./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-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_BER_test2-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 f0735ebc421a940bb70b06777060abaef432af6ff0cfdeb82bfa2e45a81b4e11 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:12:28,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:12:28,929 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:12:28,934 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:12:28,935 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:12:28,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:12:28,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:12:28,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:12:28,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:12:28,965 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:12:28,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:12:28,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:12:28,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:12:28,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:12:28,967 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:12:28,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:12:28,967 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:12:28,967 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:12:28,967 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:12:28,968 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:12:28,968 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:12:28,968 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:12:28,968 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:12:28,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:12:28,968 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:12:28,968 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:12:28,968 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:12:28,968 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:12:28,969 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:12:28,969 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:12:28,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:12:28,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:12:28,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:12:28,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:12:28,970 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:12:28,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:12:28,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:12:28,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:12:28,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:12:28,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:12:28,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:12:28,971 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:12:28,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:12:28,971 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:12:28,971 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:12:28,971 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:12:28,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:12:28,971 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 -> f0735ebc421a940bb70b06777060abaef432af6ff0cfdeb82bfa2e45a81b4e11 [2025-01-10 00:12:29,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:12:29,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:12:29,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:12:29,262 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:12:29,263 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:12:29,265 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_BER_test2-1.i [2025-01-10 00:12:30,539 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dce7ed0b5/c6fd2c2983df4bc0a42f9e323887ad84/FLAGb70e83c31 [2025-01-10 00:12:30,906 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:12:30,909 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i [2025-01-10 00:12:30,928 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dce7ed0b5/c6fd2c2983df4bc0a42f9e323887ad84/FLAGb70e83c31 [2025-01-10 00:12:30,944 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dce7ed0b5/c6fd2c2983df4bc0a42f9e323887ad84 [2025-01-10 00:12:30,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:12:30,947 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:12:30,949 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:12:30,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:12:30,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:12:30,953 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:12:30" (1/1) ... [2025-01-10 00:12:30,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3249ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:30, skipping insertion in model container [2025-01-10 00:12:30,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:12:30" (1/1) ... [2025-01-10 00:12:30,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:12:31,349 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:12:31,395 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:12:31,399 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:12:31,405 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:12:31,413 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:12:31,445 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:12:31,446 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:12:31,448 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:12:31,448 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:12:31,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:12:31,466 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:12:31,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:12:31,633 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:12:31,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:31 WrapperNode [2025-01-10 00:12:31,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:12:31,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:12:31,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:12:31,635 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:12:31,640 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:12:31" (1/1) ... [2025-01-10 00:12:31,668 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:12:31" (1/1) ... [2025-01-10 00:12:31,732 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1274 [2025-01-10 00:12:31,732 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:12:31,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:12:31,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:12:31,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:12:31,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:31" (1/1) ... [2025-01-10 00:12:31,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:31" (1/1) ... [2025-01-10 00:12:31,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:31" (1/1) ... [2025-01-10 00:12:31,818 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2025-01-10 00:12:31,819 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:31" (1/1) ... [2025-01-10 00:12:31,819 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:31" (1/1) ... [2025-01-10 00:12:31,849 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:31" (1/1) ... [2025-01-10 00:12:31,854 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:31" (1/1) ... [2025-01-10 00:12:31,875 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:31" (1/1) ... [2025-01-10 00:12:31,881 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:31" (1/1) ... [2025-01-10 00:12:31,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:31" (1/1) ... [2025-01-10 00:12:31,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:12:31,895 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:12:31,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:12:31,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:12:31,896 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:31" (1/1) ... [2025-01-10 00:12:31,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:12:31,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:12:31,953 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:12:31,956 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:12:31,980 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-01-10 00:12:31,980 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-01-10 00:12:31,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 00:12:31,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 00:12:31,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-10 00:12:31,980 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 00:12:31,980 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 00:12:31,982 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-10 00:12:31,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:12:31,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:12:31,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:12:31,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 00:12:31,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:12:31,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:12:31,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:12:31,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:12:31,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 00:12:31,983 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 00:12:31,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:12:31,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:12:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:12:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:12:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:12:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:12:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:12:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 00:12:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:12:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:12:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:12:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:12:31,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:12:32,170 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:12:32,172 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:12:32,194 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:12:32,225 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:12:32,241 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:12:34,205 INFO L? ?]: Removed 1042 outVars from TransFormulas that were not future-live. [2025-01-10 00:12:34,205 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:12:34,245 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:12:34,245 INFO L312 CfgBuilder]: Removed 27 assume(true) statements. [2025-01-10 00:12:34,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:12:34 BoogieIcfgContainer [2025-01-10 00:12:34,245 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:12:34,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:12:34,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:12:34,252 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:12:34,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:12:30" (1/3) ... [2025-01-10 00:12:34,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655bd73f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:12:34, skipping insertion in model container [2025-01-10 00:12:34,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:31" (2/3) ... [2025-01-10 00:12:34,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655bd73f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:12:34, skipping insertion in model container [2025-01-10 00:12:34,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:12:34" (3/3) ... [2025-01-10 00:12:34,256 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test2-1.i [2025-01-10 00:12:34,268 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:12:34,269 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test2-1.i that has 6 procedures, 1084 locations, 1 initial locations, 33 loop locations, and 424 error locations. [2025-01-10 00:12:34,327 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:12:34,335 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;@306b26fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:12:34,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2025-01-10 00:12:34,341 INFO L276 IsEmpty]: Start isEmpty. Operand has 1074 states, 639 states have (on average 2.0093896713615025) internal successors, (1284), 1067 states have internal predecessors, (1284), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 00:12:34,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 00:12:34,344 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:12:34,345 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 00:12:34,345 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:12:34,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:12:34,349 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2025-01-10 00:12:34,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:12:34,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734474836] [2025-01-10 00:12:34,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:34,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:12:34,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:12:34,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:12:34,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:34,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:34,538 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:12:34,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:12:34,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734474836] [2025-01-10 00:12:34,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734474836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:12:34,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:12:34,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:12:34,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342013085] [2025-01-10 00:12:34,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:12:34,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:12:34,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:12:34,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:12:34,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:12:34,568 INFO L87 Difference]: Start difference. First operand has 1074 states, 639 states have (on average 2.0093896713615025) internal successors, (1284), 1067 states have internal predecessors, (1284), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:12:35,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:12:35,270 INFO L93 Difference]: Finished difference Result 1060 states and 1234 transitions. [2025-01-10 00:12:35,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:12:35,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-01-10 00:12:35,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:12:35,295 INFO L225 Difference]: With dead ends: 1060 [2025-01-10 00:12:35,295 INFO L226 Difference]: Without dead ends: 1058 [2025-01-10 00:12:35,297 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:12:35,299 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 1099 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:12:35,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 897 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 00:12:35,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2025-01-10 00:12:35,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1058. [2025-01-10 00:12:35,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 641 states have (on average 1.8939157566302651) internal successors, (1214), 1051 states have internal predecessors, (1214), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 00:12:35,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1232 transitions. [2025-01-10 00:12:35,385 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1232 transitions. Word has length 3 [2025-01-10 00:12:35,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:12:35,385 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1232 transitions. [2025-01-10 00:12:35,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:12:35,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1232 transitions. [2025-01-10 00:12:35,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 00:12:35,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:12:35,386 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 00:12:35,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:12:35,386 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:12:35,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:12:35,387 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2025-01-10 00:12:35,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:12:35,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172032753] [2025-01-10 00:12:35,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:35,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:12:35,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:12:35,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:12:35,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:35,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:35,484 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:12:35,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:12:35,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172032753] [2025-01-10 00:12:35,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172032753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:12:35,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:12:35,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:12:35,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805719184] [2025-01-10 00:12:35,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:12:35,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:12:35,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:12:35,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:12:35,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:12:35,487 INFO L87 Difference]: Start difference. First operand 1058 states and 1232 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:12:36,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:12:36,172 INFO L93 Difference]: Finished difference Result 1377 states and 1639 transitions. [2025-01-10 00:12:36,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:12:36,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-01-10 00:12:36,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:12:36,179 INFO L225 Difference]: With dead ends: 1377 [2025-01-10 00:12:36,180 INFO L226 Difference]: Without dead ends: 1377 [2025-01-10 00:12:36,180 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:12:36,180 INFO L435 NwaCegarLoop]: 1127 mSDtfsCounter, 396 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1922 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:12:36,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1922 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 00:12:36,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2025-01-10 00:12:36,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1288. [2025-01-10 00:12:36,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 867 states have (on average 1.8546712802768166) internal successors, (1608), 1281 states have internal predecessors, (1608), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 00:12:36,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1636 transitions. [2025-01-10 00:12:36,220 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1636 transitions. Word has length 3 [2025-01-10 00:12:36,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:12:36,220 INFO L471 AbstractCegarLoop]: Abstraction has 1288 states and 1636 transitions. [2025-01-10 00:12:36,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:12:36,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1636 transitions. [2025-01-10 00:12:36,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 00:12:36,221 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:12:36,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:12:36,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:12:36,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:12:36,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:12:36,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1329215633, now seen corresponding path program 1 times [2025-01-10 00:12:36,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:12:36,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878418131] [2025-01-10 00:12:36,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:36,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:12:36,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:12:36,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:12:36,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:36,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:36,472 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:12:36,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:12:36,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878418131] [2025-01-10 00:12:36,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878418131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:12:36,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:12:36,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:12:36,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56150047] [2025-01-10 00:12:36,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:12:36,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:12:36,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:12:36,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:12:36,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:12:36,474 INFO L87 Difference]: Start difference. First operand 1288 states and 1636 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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:12:37,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:12:37,650 INFO L93 Difference]: Finished difference Result 1366 states and 1627 transitions. [2025-01-10 00:12:37,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:12:37,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2025-01-10 00:12:37,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:12:37,657 INFO L225 Difference]: With dead ends: 1366 [2025-01-10 00:12:37,657 INFO L226 Difference]: Without dead ends: 1366 [2025-01-10 00:12:37,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:12:37,660 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 3357 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3362 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:12:37,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3362 Valid, 1170 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-10 00:12:37,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2025-01-10 00:12:37,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1046. [2025-01-10 00:12:37,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 641 states have (on average 1.8736349453978158) internal successors, (1201), 1039 states have internal predecessors, (1201), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 00:12:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1219 transitions. [2025-01-10 00:12:37,692 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1219 transitions. Word has length 8 [2025-01-10 00:12:37,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:12:37,693 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1219 transitions. [2025-01-10 00:12:37,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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:12:37,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1219 transitions. [2025-01-10 00:12:37,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 00:12:37,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:12:37,694 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:12:37,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:12:37,694 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:12:37,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:12:37,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1743988334, now seen corresponding path program 1 times [2025-01-10 00:12:37,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:12:37,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092805279] [2025-01-10 00:12:37,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:37,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:12:37,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:12:37,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:12:37,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:37,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:37,772 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:12:37,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:12:37,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092805279] [2025-01-10 00:12:37,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092805279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:12:37,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:12:37,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:12:37,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131780669] [2025-01-10 00:12:37,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:12:37,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:12:37,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:12:37,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:12:37,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:12:37,774 INFO L87 Difference]: Start difference. First operand 1046 states and 1219 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:12:38,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:12:38,366 INFO L93 Difference]: Finished difference Result 1319 states and 1580 transitions. [2025-01-10 00:12:38,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:12:38,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 00:12:38,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:12:38,372 INFO L225 Difference]: With dead ends: 1319 [2025-01-10 00:12:38,372 INFO L226 Difference]: Without dead ends: 1319 [2025-01-10 00:12:38,373 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:12:38,375 INFO L435 NwaCegarLoop]: 1163 mSDtfsCounter, 1073 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:12:38,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 1488 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 00:12:38,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2025-01-10 00:12:38,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 999. [2025-01-10 00:12:38,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 641 states have (on average 1.8003120124804992) internal successors, (1154), 992 states have internal predecessors, (1154), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 00:12:38,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1172 transitions. [2025-01-10 00:12:38,398 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1172 transitions. Word has length 9 [2025-01-10 00:12:38,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:12:38,398 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1172 transitions. [2025-01-10 00:12:38,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:12:38,399 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1172 transitions. [2025-01-10 00:12:38,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 00:12:38,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:12:38,399 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:12:38,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:12:38,399 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:12:38,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:12:38,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1743988333, now seen corresponding path program 1 times [2025-01-10 00:12:38,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:12:38,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871761593] [2025-01-10 00:12:38,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:38,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:12:38,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:12:38,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:12:38,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:38,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:38,485 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:12:38,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:12:38,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871761593] [2025-01-10 00:12:38,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871761593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:12:38,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:12:38,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:12:38,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389839906] [2025-01-10 00:12:38,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:12:38,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:12:38,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:12:38,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:12:38,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:12:38,487 INFO L87 Difference]: Start difference. First operand 999 states and 1172 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:12:39,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:12:39,110 INFO L93 Difference]: Finished difference Result 1400 states and 1665 transitions. [2025-01-10 00:12:39,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:12:39,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 00:12:39,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:12:39,116 INFO L225 Difference]: With dead ends: 1400 [2025-01-10 00:12:39,116 INFO L226 Difference]: Without dead ends: 1400 [2025-01-10 00:12:39,116 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:12:39,117 INFO L435 NwaCegarLoop]: 1343 mSDtfsCounter, 814 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:12:39,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 1852 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 00:12:39,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2025-01-10 00:12:39,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1029. [2025-01-10 00:12:39,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 681 states have (on average 1.7958883994126285) internal successors, (1223), 1022 states have internal predecessors, (1223), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 00:12:39,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1241 transitions. [2025-01-10 00:12:39,142 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1241 transitions. Word has length 9 [2025-01-10 00:12:39,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:12:39,142 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1241 transitions. [2025-01-10 00:12:39,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:12:39,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1241 transitions. [2025-01-10 00:12:39,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 00:12:39,143 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:12:39,143 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:12:39,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:12:39,143 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr422ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:12:39,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:12:39,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1259515419, now seen corresponding path program 1 times [2025-01-10 00:12:39,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:12:39,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726029996] [2025-01-10 00:12:39,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:39,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:12:39,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:12:39,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:12:39,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:39,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:39,230 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:12:39,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:12:39,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726029996] [2025-01-10 00:12:39,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726029996] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:12:39,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:12:39,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:12:39,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288391253] [2025-01-10 00:12:39,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:12:39,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:12:39,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:12:39,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:12:39,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:12:39,232 INFO L87 Difference]: Start difference. First operand 1029 states and 1241 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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:12:39,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:12:39,374 INFO L93 Difference]: Finished difference Result 2036 states and 2462 transitions. [2025-01-10 00:12:39,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:12:39,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-01-10 00:12:39,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:12:39,381 INFO L225 Difference]: With dead ends: 2036 [2025-01-10 00:12:39,382 INFO L226 Difference]: Without dead ends: 2036 [2025-01-10 00:12:39,382 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:12:39,383 INFO L435 NwaCegarLoop]: 1346 mSDtfsCounter, 1113 mSDsluCounter, 2449 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 3795 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:12:39,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 3795 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:12:39,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2025-01-10 00:12:39,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 1031. [2025-01-10 00:12:39,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 683 states have (on average 1.7935578330893118) internal successors, (1225), 1024 states have internal predecessors, (1225), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 00:12:39,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1243 transitions. [2025-01-10 00:12:39,410 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1243 transitions. Word has length 10 [2025-01-10 00:12:39,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:12:39,410 INFO L471 AbstractCegarLoop]: Abstraction has 1031 states and 1243 transitions. [2025-01-10 00:12:39,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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:12:39,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1243 transitions. [2025-01-10 00:12:39,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 00:12:39,411 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:12:39,411 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:12:39,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:12:39,411 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:12:39,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:12:39,412 INFO L85 PathProgramCache]: Analyzing trace with hash 495194974, now seen corresponding path program 1 times [2025-01-10 00:12:39,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:12:39,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93943630] [2025-01-10 00:12:39,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:39,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:12:39,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:12:39,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:12:39,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:39,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:39,497 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:12:39,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:12:39,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93943630] [2025-01-10 00:12:39,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93943630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:12:39,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:12:39,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:12:39,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705655208] [2025-01-10 00:12:39,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:12:39,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:12:39,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:12:39,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:12:39,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:12:39,500 INFO L87 Difference]: Start difference. First operand 1031 states and 1243 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:12:40,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:12:40,165 INFO L93 Difference]: Finished difference Result 1058 states and 1297 transitions. [2025-01-10 00:12:40,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:12:40,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-10 00:12:40,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:12:40,169 INFO L225 Difference]: With dead ends: 1058 [2025-01-10 00:12:40,169 INFO L226 Difference]: Without dead ends: 1058 [2025-01-10 00:12:40,169 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:12:40,170 INFO L435 NwaCegarLoop]: 736 mSDtfsCounter, 1337 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1345 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:12:40,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1345 Valid, 1336 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 00:12:40,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2025-01-10 00:12:40,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1008. [2025-01-10 00:12:40,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 683 states have (on average 1.759882869692533) internal successors, (1202), 1001 states have internal predecessors, (1202), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 00:12:40,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1220 transitions. [2025-01-10 00:12:40,189 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1220 transitions. Word has length 19 [2025-01-10 00:12:40,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:12:40,189 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1220 transitions. [2025-01-10 00:12:40,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:12:40,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1220 transitions. [2025-01-10 00:12:40,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 00:12:40,190 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:12:40,190 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:12:40,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:12:40,191 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:12:40,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:12:40,191 INFO L85 PathProgramCache]: Analyzing trace with hash 495194975, now seen corresponding path program 1 times [2025-01-10 00:12:40,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:12:40,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14638984] [2025-01-10 00:12:40,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:40,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:12:40,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:12:40,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:12:40,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:40,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:40,284 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:12:40,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:12:40,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14638984] [2025-01-10 00:12:40,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14638984] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:12:40,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:12:40,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:12:40,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074523804] [2025-01-10 00:12:40,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:12:40,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:12:40,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:12:40,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:12:40,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:12:40,286 INFO L87 Difference]: Start difference. First operand 1008 states and 1220 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:12:40,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:12:40,310 INFO L93 Difference]: Finished difference Result 933 states and 1117 transitions. [2025-01-10 00:12:40,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:12:40,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-10 00:12:40,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:12:40,314 INFO L225 Difference]: With dead ends: 933 [2025-01-10 00:12:40,314 INFO L226 Difference]: Without dead ends: 933 [2025-01-10 00:12:40,314 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:12:40,314 INFO L435 NwaCegarLoop]: 1017 mSDtfsCounter, 60 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1981 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:12:40,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1981 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:12:40,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-01-10 00:12:40,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 933. [2025-01-10 00:12:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 620 states have (on average 1.7725806451612902) internal successors, (1099), 926 states have internal predecessors, (1099), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 00:12:40,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1117 transitions. [2025-01-10 00:12:40,330 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1117 transitions. Word has length 19 [2025-01-10 00:12:40,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:12:40,331 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1117 transitions. [2025-01-10 00:12:40,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:12:40,331 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1117 transitions. [2025-01-10 00:12:40,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 00:12:40,331 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:12:40,331 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] [2025-01-10 00:12:40,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:12:40,332 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:12:40,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:12:40,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1828609380, now seen corresponding path program 1 times [2025-01-10 00:12:40,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:12:40,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187853239] [2025-01-10 00:12:40,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:40,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:12:40,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:12:40,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:12:40,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:40,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:40,396 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:12:40,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:12:40,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187853239] [2025-01-10 00:12:40,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187853239] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:12:40,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:12:40,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:12:40,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286232295] [2025-01-10 00:12:40,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:12:40,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:12:40,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:12:40,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:12:40,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:12:40,398 INFO L87 Difference]: Start difference. First operand 933 states and 1117 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:12:40,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:12:40,453 INFO L93 Difference]: Finished difference Result 915 states and 1092 transitions. [2025-01-10 00:12:40,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:12:40,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-10 00:12:40,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:12:40,457 INFO L225 Difference]: With dead ends: 915 [2025-01-10 00:12:40,457 INFO L226 Difference]: Without dead ends: 915 [2025-01-10 00:12:40,457 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:12:40,462 INFO L435 NwaCegarLoop]: 982 mSDtfsCounter, 41 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2918 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:12:40,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2918 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:12:40,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2025-01-10 00:12:40,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 912. [2025-01-10 00:12:40,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 606 states have (on average 1.7673267326732673) internal successors, (1071), 905 states have internal predecessors, (1071), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 00:12:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1089 transitions. [2025-01-10 00:12:40,479 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1089 transitions. Word has length 20 [2025-01-10 00:12:40,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:12:40,480 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1089 transitions. [2025-01-10 00:12:40,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:12:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1089 transitions. [2025-01-10 00:12:40,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 00:12:40,481 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:12:40,481 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] [2025-01-10 00:12:40,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:12:40,481 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:12:40,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:12:40,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1048342954, now seen corresponding path program 1 times [2025-01-10 00:12:40,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:12:40,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186083485] [2025-01-10 00:12:40,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:40,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:12:40,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 00:12:40,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 00:12:40,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:40,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:40,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:12:40,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:12:40,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186083485] [2025-01-10 00:12:40,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186083485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:12:40,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:12:40,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:12:40,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160678747] [2025-01-10 00:12:40,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:12:40,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:12:40,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:12:40,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:12:40,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:12:40,623 INFO L87 Difference]: Start difference. First operand 912 states and 1089 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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:12:41,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:12:41,350 INFO L93 Difference]: Finished difference Result 1328 states and 1585 transitions. [2025-01-10 00:12:41,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:12:41,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2025-01-10 00:12:41,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:12:41,354 INFO L225 Difference]: With dead ends: 1328 [2025-01-10 00:12:41,354 INFO L226 Difference]: Without dead ends: 1328 [2025-01-10 00:12:41,354 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:12:41,355 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 815 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:12:41,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1926 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 00:12:41,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2025-01-10 00:12:41,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 908. [2025-01-10 00:12:41,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 606 states have (on average 1.7607260726072607) internal successors, (1067), 901 states have internal predecessors, (1067), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 00:12:41,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1085 transitions. [2025-01-10 00:12:41,372 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1085 transitions. Word has length 34 [2025-01-10 00:12:41,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:12:41,373 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1085 transitions. [2025-01-10 00:12:41,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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:12:41,373 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1085 transitions. [2025-01-10 00:12:41,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-10 00:12:41,374 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:12:41,375 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:12:41,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:12:41,375 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:12:41,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:12:41,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1085651552, now seen corresponding path program 1 times [2025-01-10 00:12:41,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:12:41,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399735254] [2025-01-10 00:12:41,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:41,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:12:41,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 00:12:41,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 00:12:41,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:41,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:41,530 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:12:41,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:12:41,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399735254] [2025-01-10 00:12:41,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399735254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:12:41,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:12:41,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:12:41,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601685709] [2025-01-10 00:12:41,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:12:41,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:12:41,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:12:41,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:12:41,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:12:41,533 INFO L87 Difference]: Start difference. First operand 908 states and 1085 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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:12:41,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:12:41,577 INFO L93 Difference]: Finished difference Result 908 states and 1081 transitions. [2025-01-10 00:12:41,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:12:41,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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:12:41,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:12:41,582 INFO L225 Difference]: With dead ends: 908 [2025-01-10 00:12:41,582 INFO L226 Difference]: Without dead ends: 908 [2025-01-10 00:12:41,582 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:12:41,583 INFO L435 NwaCegarLoop]: 977 mSDtfsCounter, 21 mSDsluCounter, 1923 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2900 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:12:41,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2900 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:12:41,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2025-01-10 00:12:41,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 908. [2025-01-10 00:12:41,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 606 states have (on average 1.7541254125412542) internal successors, (1063), 901 states have internal predecessors, (1063), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 00:12:41,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1081 transitions. [2025-01-10 00:12:41,599 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1081 transitions. Word has length 68 [2025-01-10 00:12:41,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:12:41,600 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1081 transitions. [2025-01-10 00:12:41,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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:12:41,600 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1081 transitions. [2025-01-10 00:12:41,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-10 00:12:41,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:12:41,603 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:12:41,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:12:41,603 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:12:41,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:12:41,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1491712468, now seen corresponding path program 1 times [2025-01-10 00:12:41,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:12:41,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815109989] [2025-01-10 00:12:41,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:41,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:12:41,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-10 00:12:41,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-10 00:12:41,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:41,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:41,775 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:12:41,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:12:41,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815109989] [2025-01-10 00:12:41,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815109989] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:12:41,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:12:41,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:12:41,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966851630] [2025-01-10 00:12:41,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:12:41,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:12:41,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:12:41,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:12:41,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:12:41,778 INFO L87 Difference]: Start difference. First operand 908 states and 1081 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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:12:41,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:12:41,835 INFO L93 Difference]: Finished difference Result 1246 states and 1523 transitions. [2025-01-10 00:12:41,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:12:41,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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:12:41,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:12:41,839 INFO L225 Difference]: With dead ends: 1246 [2025-01-10 00:12:41,839 INFO L226 Difference]: Without dead ends: 1246 [2025-01-10 00:12:41,840 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:12:41,840 INFO L435 NwaCegarLoop]: 1272 mSDtfsCounter, 360 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:12:41,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 2218 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:12:41,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2025-01-10 00:12:41,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1192. [2025-01-10 00:12:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 885 states have (on average 1.6858757062146892) internal successors, (1492), 1185 states have internal predecessors, (1492), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 00:12:41,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1520 transitions. [2025-01-10 00:12:41,860 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1520 transitions. Word has length 76 [2025-01-10 00:12:41,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:12:41,860 INFO L471 AbstractCegarLoop]: Abstraction has 1192 states and 1520 transitions. [2025-01-10 00:12:41,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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:12:41,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1520 transitions. [2025-01-10 00:12:41,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-10 00:12:41,861 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:12:41,861 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] [2025-01-10 00:12:41,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:12:41,862 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:12:41,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:12:41,862 INFO L85 PathProgramCache]: Analyzing trace with hash 311454554, now seen corresponding path program 1 times [2025-01-10 00:12:41,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:12:41,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519910647] [2025-01-10 00:12:41,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:41,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:12:41,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-10 00:12:41,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-10 00:12:41,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:41,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:42,432 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:12:42,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:12:42,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519910647] [2025-01-10 00:12:42,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519910647] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:12:42,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:12:42,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:12:42,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55185969] [2025-01-10 00:12:42,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:12:42,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:12:42,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:12:42,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:12:42,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:12:42,434 INFO L87 Difference]: Start difference. First operand 1192 states and 1520 transitions. Second operand has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 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:12:43,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:12:43,140 INFO L93 Difference]: Finished difference Result 1154 states and 1482 transitions. [2025-01-10 00:12:43,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:12:43,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 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 79 [2025-01-10 00:12:43,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:12:43,145 INFO L225 Difference]: With dead ends: 1154 [2025-01-10 00:12:43,145 INFO L226 Difference]: Without dead ends: 1154 [2025-01-10 00:12:43,145 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:12:43,145 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 1731 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1739 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:12:43,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1739 Valid, 985 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 00:12:43,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2025-01-10 00:12:43,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1114. [2025-01-10 00:12:43,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 845 states have (on average 1.6272189349112427) internal successors, (1375), 1107 states have internal predecessors, (1375), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 00:12:43,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1403 transitions. [2025-01-10 00:12:43,164 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1403 transitions. Word has length 79 [2025-01-10 00:12:43,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:12:43,165 INFO L471 AbstractCegarLoop]: Abstraction has 1114 states and 1403 transitions. [2025-01-10 00:12:43,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 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:12:43,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1403 transitions. [2025-01-10 00:12:43,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-10 00:12:43,166 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:12:43,166 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:12:43,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:12:43,166 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:12:43,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:12:43,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1497079487, now seen corresponding path program 1 times [2025-01-10 00:12:43,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:12:43,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346882267] [2025-01-10 00:12:43,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:43,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:12:43,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-10 00:12:43,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 00:12:43,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:43,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:43,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:12:43,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:12:43,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346882267] [2025-01-10 00:12:43,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346882267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:12:43,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:12:43,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:12:43,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998301610] [2025-01-10 00:12:43,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:12:43,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:12:43,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:12:43,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:12:43,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:12:43,436 INFO L87 Difference]: Start difference. First operand 1114 states and 1403 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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:12:44,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:12:44,076 INFO L93 Difference]: Finished difference Result 1113 states and 1402 transitions. [2025-01-10 00:12:44,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:12:44,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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 84 [2025-01-10 00:12:44,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:12:44,079 INFO L225 Difference]: With dead ends: 1113 [2025-01-10 00:12:44,079 INFO L226 Difference]: Without dead ends: 1113 [2025-01-10 00:12:44,079 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:12:44,080 INFO L435 NwaCegarLoop]: 949 mSDtfsCounter, 2 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2828 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:12:44,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2828 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 00:12:44,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2025-01-10 00:12:44,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2025-01-10 00:12:44,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 845 states have (on average 1.6260355029585798) internal successors, (1374), 1106 states have internal predecessors, (1374), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 00:12:44,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1402 transitions. [2025-01-10 00:12:44,096 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1402 transitions. Word has length 84 [2025-01-10 00:12:44,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:12:44,097 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1402 transitions. [2025-01-10 00:12:44,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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:12:44,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1402 transitions. [2025-01-10 00:12:44,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-10 00:12:44,098 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:12:44,098 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:12:44,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:12:44,098 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:12:44,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:12:44,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1497079488, now seen corresponding path program 1 times [2025-01-10 00:12:44,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:12:44,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080563845] [2025-01-10 00:12:44,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:44,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:12:44,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-10 00:12:44,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 00:12:44,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:44,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:44,537 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:12:44,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:12:44,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080563845] [2025-01-10 00:12:44,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080563845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:12:44,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:12:44,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:12:44,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403758064] [2025-01-10 00:12:44,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:12:44,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:12:44,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:12:44,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:12:44,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:12:44,539 INFO L87 Difference]: Start difference. First operand 1113 states and 1402 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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:12:45,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:12:45,246 INFO L93 Difference]: Finished difference Result 1112 states and 1401 transitions. [2025-01-10 00:12:45,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:12:45,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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 84 [2025-01-10 00:12:45,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:12:45,250 INFO L225 Difference]: With dead ends: 1112 [2025-01-10 00:12:45,250 INFO L226 Difference]: Without dead ends: 1112 [2025-01-10 00:12:45,250 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:12:45,251 INFO L435 NwaCegarLoop]: 949 mSDtfsCounter, 1 mSDsluCounter, 1896 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2845 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:12:45,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2845 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 00:12:45,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2025-01-10 00:12:45,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1112. [2025-01-10 00:12:45,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1112 states, 844 states have (on average 1.6267772511848342) internal successors, (1373), 1105 states have internal predecessors, (1373), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 00:12:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1401 transitions. [2025-01-10 00:12:45,270 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1401 transitions. Word has length 84 [2025-01-10 00:12:45,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:12:45,270 INFO L471 AbstractCegarLoop]: Abstraction has 1112 states and 1401 transitions. [2025-01-10 00:12:45,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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:12:45,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1401 transitions. [2025-01-10 00:12:45,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-10 00:12:45,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:12:45,271 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] [2025-01-10 00:12:45,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:12:45,271 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:12:45,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:12:45,272 INFO L85 PathProgramCache]: Analyzing trace with hash -848442586, now seen corresponding path program 1 times [2025-01-10 00:12:45,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:12:45,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041801366] [2025-01-10 00:12:45,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:45,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:12:45,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-10 00:12:45,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 00:12:45,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:45,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:45,524 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:12:45,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:12:45,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041801366] [2025-01-10 00:12:45,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041801366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:12:45,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:12:45,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:12:45,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792922386] [2025-01-10 00:12:45,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:12:45,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:12:45,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:12:45,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:12:45,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:12:45,527 INFO L87 Difference]: Start difference. First operand 1112 states and 1401 transitions. Second operand has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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:12:46,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:12:46,239 INFO L93 Difference]: Finished difference Result 1124 states and 1416 transitions. [2025-01-10 00:12:46,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:12:46,240 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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 92 [2025-01-10 00:12:46,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:12:46,243 INFO L225 Difference]: With dead ends: 1124 [2025-01-10 00:12:46,243 INFO L226 Difference]: Without dead ends: 1124 [2025-01-10 00:12:46,244 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:12:46,245 INFO L435 NwaCegarLoop]: 934 mSDtfsCounter, 13 mSDsluCounter, 2852 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3786 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:12:46,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3786 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 00:12:46,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2025-01-10 00:12:46,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1118. [2025-01-10 00:12:46,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 849 states have (on average 1.6254416961130742) internal successors, (1380), 1110 states have internal predecessors, (1380), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (16), 6 states have call predecessors, (16), 13 states have call successors, (16) [2025-01-10 00:12:46,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1411 transitions. [2025-01-10 00:12:46,263 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1411 transitions. Word has length 92 [2025-01-10 00:12:46,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:12:46,264 INFO L471 AbstractCegarLoop]: Abstraction has 1118 states and 1411 transitions. [2025-01-10 00:12:46,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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:12:46,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1411 transitions. [2025-01-10 00:12:46,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-10 00:12:46,265 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:12:46,265 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] [2025-01-10 00:12:46,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 00:12:46,265 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:12:46,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:12:46,266 INFO L85 PathProgramCache]: Analyzing trace with hash -848442585, now seen corresponding path program 1 times [2025-01-10 00:12:46,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:12:46,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881327987] [2025-01-10 00:12:46,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:46,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:12:46,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-10 00:12:46,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 00:12:46,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:46,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:46,757 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:12:46,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:12:46,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881327987] [2025-01-10 00:12:46,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881327987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:12:46,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:12:46,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:12:46,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133914809] [2025-01-10 00:12:46,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:12:46,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:12:46,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:12:46,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:12:46,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:12:46,759 INFO L87 Difference]: Start difference. First operand 1118 states and 1411 transitions. Second operand has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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:12:47,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:12:47,609 INFO L93 Difference]: Finished difference Result 1118 states and 1410 transitions. [2025-01-10 00:12:47,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:12:47,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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 92 [2025-01-10 00:12:47,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:12:47,615 INFO L225 Difference]: With dead ends: 1118 [2025-01-10 00:12:47,615 INFO L226 Difference]: Without dead ends: 1118 [2025-01-10 00:12:47,615 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:12:47,616 INFO L435 NwaCegarLoop]: 938 mSDtfsCounter, 8 mSDsluCounter, 2671 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3609 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:12:47,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3609 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 00:12:47,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2025-01-10 00:12:47,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1118. [2025-01-10 00:12:47,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 849 states have (on average 1.624263839811543) internal successors, (1379), 1110 states have internal predecessors, (1379), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (16), 6 states have call predecessors, (16), 13 states have call successors, (16) [2025-01-10 00:12:47,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1410 transitions. [2025-01-10 00:12:47,631 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1410 transitions. Word has length 92 [2025-01-10 00:12:47,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:12:47,632 INFO L471 AbstractCegarLoop]: Abstraction has 1118 states and 1410 transitions. [2025-01-10 00:12:47,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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:12:47,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1410 transitions. [2025-01-10 00:12:47,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-10 00:12:47,632 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:12:47,633 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:12:47,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 00:12:47,633 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:12:47,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:12:47,633 INFO L85 PathProgramCache]: Analyzing trace with hash 37298660, now seen corresponding path program 1 times [2025-01-10 00:12:47,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:12:47,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083765116] [2025-01-10 00:12:47,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:47,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:12:47,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 00:12:47,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 00:12:47,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:47,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:48,117 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:12:48,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:12:48,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083765116] [2025-01-10 00:12:48,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083765116] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:12:48,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654738158] [2025-01-10 00:12:48,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:48,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:12:48,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:12:48,122 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:12:48,123 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:12:48,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 00:12:48,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 00:12:48,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:48,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:48,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 00:12:48,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:12:48,374 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:12:48,523 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:12:48,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-10 00:12:48,560 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:12:48,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-10 00:12:48,861 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:12:48,862 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:12:48,913 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:12:48,951 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:12:48,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:12:48,993 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_650 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_650) |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:12:48,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654738158] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:12:48,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:12:48,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2025-01-10 00:12:48,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657345658] [2025-01-10 00:12:48,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:12:48,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 00:12:48,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:12:48,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 00:12:48,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2025-01-10 00:12:48,997 INFO L87 Difference]: Start difference. First operand 1118 states and 1410 transitions. Second operand has 19 states, 16 states have (on average 9.125) internal successors, (146), 18 states have internal predecessors, (146), 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:12:52,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:12:52,126 INFO L93 Difference]: Finished difference Result 1125 states and 1417 transitions. [2025-01-10 00:12:52,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:12:52,126 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.125) internal successors, (146), 18 states have internal predecessors, (146), 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 93 [2025-01-10 00:12:52,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:12:52,130 INFO L225 Difference]: With dead ends: 1125 [2025-01-10 00:12:52,131 INFO L226 Difference]: Without dead ends: 1125 [2025-01-10 00:12:52,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=427, Unknown=1, NotChecked=42, Total=552 [2025-01-10 00:12:52,131 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 868 mSDsluCounter, 7821 mSDsCounter, 0 mSdLazyCounter, 4833 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 8445 SdHoareTripleChecker+Invalid, 4854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:12:52,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 8445 Invalid, 4854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4833 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-10 00:12:52,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2025-01-10 00:12:52,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1122. [2025-01-10 00:12:52,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 853 states have (on average 1.6213364595545134) internal successors, (1383), 1113 states have internal predecessors, (1383), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-01-10 00:12:52,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1412 transitions. [2025-01-10 00:12:52,150 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1412 transitions. Word has length 93 [2025-01-10 00:12:52,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:12:52,151 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1412 transitions. [2025-01-10 00:12:52,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.125) internal successors, (146), 18 states have internal predecessors, (146), 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:12:52,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1412 transitions. [2025-01-10 00:12:52,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-10 00:12:52,152 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:12:52,152 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:12:52,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 00:12:52,356 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,SelfDestructingSolverStorable17 [2025-01-10 00:12:52,356 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:12:52,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:12:52,357 INFO L85 PathProgramCache]: Analyzing trace with hash 37298661, now seen corresponding path program 1 times [2025-01-10 00:12:52,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:12:52,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356795942] [2025-01-10 00:12:52,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:52,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:12:52,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 00:12:52,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 00:12:52,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:52,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:53,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:12:53,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:12:53,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356795942] [2025-01-10 00:12:53,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356795942] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:12:53,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308759731] [2025-01-10 00:12:53,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:53,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:12:53,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:12:53,128 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:12:53,130 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:12:53,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 00:12:53,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 00:12:53,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:53,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:53,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 00:12:53,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:12:53,358 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:12:53,473 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:12:53,474 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:12:53,481 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:12:53,497 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:12:53,500 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:12:53,567 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:12:53,572 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:12:53,696 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:12:53,696 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:12:53,701 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:12:53,729 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:12:53,736 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:12:53,738 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:12:53,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:12:53,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308759731] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:12:53,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:12:53,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2025-01-10 00:12:53,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419827501] [2025-01-10 00:12:53,872 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:12:53,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 00:12:53,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:12:53,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 00:12:53,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=249, Unknown=5, NotChecked=0, Total=306 [2025-01-10 00:12:53,874 INFO L87 Difference]: Start difference. First operand 1122 states and 1412 transitions. Second operand has 15 states, 12 states have (on average 11.666666666666666) internal successors, (140), 15 states have internal predecessors, (140), 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:12:55,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:12:55,614 INFO L93 Difference]: Finished difference Result 1124 states and 1416 transitions. [2025-01-10 00:12:55,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:12:55,614 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 11.666666666666666) internal successors, (140), 15 states have internal predecessors, (140), 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 93 [2025-01-10 00:12:55,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:12:55,618 INFO L225 Difference]: With dead ends: 1124 [2025-01-10 00:12:55,618 INFO L226 Difference]: Without dead ends: 1124 [2025-01-10 00:12:55,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=375, Unknown=6, NotChecked=0, Total=462 [2025-01-10 00:12:55,619 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 868 mSDsluCounter, 4337 mSDsCounter, 0 mSdLazyCounter, 3554 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 4964 SdHoareTripleChecker+Invalid, 3576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:12:55,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 4964 Invalid, 3576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 3554 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-10 00:12:55,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2025-01-10 00:12:55,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1115. [2025-01-10 00:12:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 848 states have (on average 1.6226415094339623) internal successors, (1376), 1107 states have internal predecessors, (1376), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 00:12:55,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1404 transitions. [2025-01-10 00:12:55,636 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1404 transitions. Word has length 93 [2025-01-10 00:12:55,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:12:55,636 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1404 transitions. [2025-01-10 00:12:55,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 11.666666666666666) internal successors, (140), 15 states have internal predecessors, (140), 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:12:55,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1404 transitions. [2025-01-10 00:12:55,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-10 00:12:55,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:12:55,638 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] [2025-01-10 00:12:55,647 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:12:55,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:12:55,842 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:12:55,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:12:55,842 INFO L85 PathProgramCache]: Analyzing trace with hash -69903039, now seen corresponding path program 1 times [2025-01-10 00:12:55,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:12:55,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074387060] [2025-01-10 00:12:55,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:55,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:12:55,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 00:12:55,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 00:12:55,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:55,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:56,323 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:12:56,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:12:56,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074387060] [2025-01-10 00:12:56,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074387060] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:12:56,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:12:56,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-10 00:12:56,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134616592] [2025-01-10 00:12:56,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:12:56,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:12:56,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:12:56,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:12:56,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:12:56,327 INFO L87 Difference]: Start difference. First operand 1115 states and 1404 transitions. Second operand has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 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:12:57,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:12:57,764 INFO L93 Difference]: Finished difference Result 1128 states and 1420 transitions. [2025-01-10 00:12:57,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:12:57,765 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 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 95 [2025-01-10 00:12:57,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:12:57,768 INFO L225 Difference]: With dead ends: 1128 [2025-01-10 00:12:57,768 INFO L226 Difference]: Without dead ends: 1128 [2025-01-10 00:12:57,768 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:12:57,768 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 903 mSDsluCounter, 4844 mSDsCounter, 0 mSdLazyCounter, 3106 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 5468 SdHoareTripleChecker+Invalid, 3125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:12:57,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 5468 Invalid, 3125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3106 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-10 00:12:57,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2025-01-10 00:12:57,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1124. [2025-01-10 00:12:57,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 856 states have (on average 1.6191588785046729) internal successors, (1386), 1115 states have internal predecessors, (1386), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-01-10 00:12:57,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1415 transitions. [2025-01-10 00:12:57,784 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1415 transitions. Word has length 95 [2025-01-10 00:12:57,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:12:57,784 INFO L471 AbstractCegarLoop]: Abstraction has 1124 states and 1415 transitions. [2025-01-10 00:12:57,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 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:12:57,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1415 transitions. [2025-01-10 00:12:57,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-10 00:12:57,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:12:57,785 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] [2025-01-10 00:12:57,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 00:12:57,786 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:12:57,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:12:57,786 INFO L85 PathProgramCache]: Analyzing trace with hash -69903038, now seen corresponding path program 1 times [2025-01-10 00:12:57,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:12:57,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654336235] [2025-01-10 00:12:57,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:12:57,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:12:57,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 00:12:57,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 00:12:57,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:12:57,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:12:58,408 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:12:58,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:12:58,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654336235] [2025-01-10 00:12:58,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654336235] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:12:58,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:12:58,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:12:58,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619701363] [2025-01-10 00:12:58,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:12:58,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:12:58,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:12:58,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:12:58,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:12:58,410 INFO L87 Difference]: Start difference. First operand 1124 states and 1415 transitions. Second operand has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 states have internal predecessors, (93), 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:13:00,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:00,051 INFO L93 Difference]: Finished difference Result 1127 states and 1419 transitions. [2025-01-10 00:13:00,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:13:00,051 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 states have internal predecessors, (93), 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 95 [2025-01-10 00:13:00,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:00,055 INFO L225 Difference]: With dead ends: 1127 [2025-01-10 00:13:00,055 INFO L226 Difference]: Without dead ends: 1127 [2025-01-10 00:13:00,055 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:13:00,056 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 880 mSDsluCounter, 3640 mSDsCounter, 0 mSdLazyCounter, 3328 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 4268 SdHoareTripleChecker+Invalid, 3345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:00,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 4268 Invalid, 3345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3328 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-10 00:13:00,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2025-01-10 00:13:00,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1124. [2025-01-10 00:13:00,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 856 states have (on average 1.6179906542056075) internal successors, (1385), 1115 states have internal predecessors, (1385), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-01-10 00:13:00,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1414 transitions. [2025-01-10 00:13:00,073 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1414 transitions. Word has length 95 [2025-01-10 00:13:00,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:00,073 INFO L471 AbstractCegarLoop]: Abstraction has 1124 states and 1414 transitions. [2025-01-10 00:13:00,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 states have internal predecessors, (93), 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:13:00,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1414 transitions. [2025-01-10 00:13:00,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-10 00:13:00,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:00,076 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] [2025-01-10 00:13:00,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 00:13:00,076 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:13:00,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:00,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1231510077, now seen corresponding path program 1 times [2025-01-10 00:13:00,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:00,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059614329] [2025-01-10 00:13:00,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:00,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:00,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-10 00:13:00,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 00:13:00,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:00,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:00,561 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:13:00,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:00,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059614329] [2025-01-10 00:13:00,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059614329] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:13:00,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293087273] [2025-01-10 00:13:00,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:00,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:13:00,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:13:00,565 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:13:00,568 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:13:00,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-10 00:13:00,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 00:13:00,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:00,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:00,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 00:13:00,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:13:00,815 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:13:00,940 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:13:00,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-10 00:13:00,971 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:13:01,043 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:13:01,179 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:01,180 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:13:01,265 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:01,265 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:13:01,284 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:13:01,316 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:13:01,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:13:01,326 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1076 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1076) |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:13:01,379 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1076 (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~mem54#1.base| v_ArrVal_1079))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1076)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:13:01,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293087273] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:13:01,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:13:01,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-01-10 00:13:01,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141427209] [2025-01-10 00:13:01,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:13:01,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 00:13:01,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:01,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 00:13:01,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=421, Unknown=13, NotChecked=86, Total=600 [2025-01-10 00:13:01,382 INFO L87 Difference]: Start difference. First operand 1124 states and 1414 transitions. Second operand has 22 states, 19 states have (on average 8.0) internal successors, (152), 21 states have internal predecessors, (152), 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:13:03,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:03,872 INFO L93 Difference]: Finished difference Result 1126 states and 1418 transitions. [2025-01-10 00:13:03,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:13:03,873 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.0) internal successors, (152), 21 states have internal predecessors, (152), 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 96 [2025-01-10 00:13:03,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:03,877 INFO L225 Difference]: With dead ends: 1126 [2025-01-10 00:13:03,877 INFO L226 Difference]: Without dead ends: 1126 [2025-01-10 00:13:03,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=542, Unknown=14, NotChecked=98, Total=756 [2025-01-10 00:13:03,879 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 861 mSDsluCounter, 8996 mSDsCounter, 0 mSdLazyCounter, 5538 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 9619 SdHoareTripleChecker+Invalid, 5556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 5538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:03,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 9619 Invalid, 5556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 5538 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-10 00:13:03,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2025-01-10 00:13:03,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1123. [2025-01-10 00:13:03,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 856 states have (on average 1.6168224299065421) internal successors, (1384), 1114 states have internal predecessors, (1384), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-01-10 00:13:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1413 transitions. [2025-01-10 00:13:03,896 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1413 transitions. Word has length 96 [2025-01-10 00:13:03,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:03,896 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1413 transitions. [2025-01-10 00:13:03,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.0) internal successors, (152), 21 states have internal predecessors, (152), 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:13:03,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1413 transitions. [2025-01-10 00:13:03,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-10 00:13:03,897 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:13:03,907 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:13:04,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:13:04,098 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:13:04,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:04,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1231510076, now seen corresponding path program 1 times [2025-01-10 00:13:04,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:04,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379722290] [2025-01-10 00:13:04,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:04,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:04,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-10 00:13:04,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 00:13:04,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:04,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:04,866 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:13:04,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:04,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379722290] [2025-01-10 00:13:04,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379722290] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:13:04,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124906632] [2025-01-10 00:13:04,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:04,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:13:04,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:13:04,869 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:13:04,871 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:13:05,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-10 00:13:05,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 00:13:05,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:05,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:05,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-10 00:13:05,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:13:05,101 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:13:05,196 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:13:05,204 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:13:05,204 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:13:05,215 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:13:05,220 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:13:05,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 22 treesize of output 10 [2025-01-10 00:13:05,286 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:13:05,390 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:05,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:13:05,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:13:05,459 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:05,460 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:13:05,467 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:13:05,483 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:13:05,487 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:13:05,491 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:13:05,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:13:05,596 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_1232 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1232) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1232 (Array Int Int)) (v_ArrVal_1231 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1232) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1231) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-01-10 00:13:05,643 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1232 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1237) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1232) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1232 (Array Int Int)) (v_ArrVal_1231 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1238))) (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~mem54#1.base| v_ArrVal_1237) .cse1 v_ArrVal_1232) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1231) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-01-10 00:13:05,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124906632] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:13:05,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:13:05,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2025-01-10 00:13:05,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061525677] [2025-01-10 00:13:05,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:13:05,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 00:13:05,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:05,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 00:13:05,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=304, Unknown=17, NotChecked=74, Total=462 [2025-01-10 00:13:05,647 INFO L87 Difference]: Start difference. First operand 1123 states and 1413 transitions. Second operand has 17 states, 14 states have (on average 10.357142857142858) internal successors, (145), 17 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:13:07,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:07,768 INFO L93 Difference]: Finished difference Result 1125 states and 1417 transitions. [2025-01-10 00:13:07,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:13:07,769 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 10.357142857142858) internal successors, (145), 17 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2025-01-10 00:13:07,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:07,773 INFO L225 Difference]: With dead ends: 1125 [2025-01-10 00:13:07,773 INFO L226 Difference]: Without dead ends: 1125 [2025-01-10 00:13:07,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=486, Unknown=17, NotChecked=94, Total=702 [2025-01-10 00:13:07,774 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 870 mSDsluCounter, 5191 mSDsCounter, 0 mSdLazyCounter, 4621 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 5817 SdHoareTripleChecker+Invalid, 4650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:07,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 5817 Invalid, 4650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 4621 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-10 00:13:07,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2025-01-10 00:13:07,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1113. [2025-01-10 00:13:07,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 848 states have (on average 1.6202830188679245) internal successors, (1374), 1105 states have internal predecessors, (1374), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 00:13:07,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1402 transitions. [2025-01-10 00:13:07,787 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1402 transitions. Word has length 96 [2025-01-10 00:13:07,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:07,787 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1402 transitions. [2025-01-10 00:13:07,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 10.357142857142858) internal successors, (145), 17 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:13:07,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1402 transitions. [2025-01-10 00:13:07,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-10 00:13:07,787 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:07,787 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, 1] [2025-01-10 00:13:07,795 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:13:07,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-10 00:13:07,988 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:13:07,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:07,989 INFO L85 PathProgramCache]: Analyzing trace with hash 578350189, now seen corresponding path program 1 times [2025-01-10 00:13:07,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:07,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899717010] [2025-01-10 00:13:07,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:07,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:08,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 00:13:08,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 00:13:08,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:08,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:08,463 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:13:08,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:08,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899717010] [2025-01-10 00:13:08,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899717010] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:13:08,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:13:08,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-10 00:13:08,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638979862] [2025-01-10 00:13:08,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:13:08,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 00:13:08,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:08,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 00:13:08,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-01-10 00:13:08,465 INFO L87 Difference]: Start difference. First operand 1113 states and 1402 transitions. Second operand has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 states have internal predecessors, (96), 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:13:10,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:10,024 INFO L93 Difference]: Finished difference Result 1129 states and 1421 transitions. [2025-01-10 00:13:10,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:13:10,024 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 states have internal predecessors, (96), 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 98 [2025-01-10 00:13:10,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:10,028 INFO L225 Difference]: With dead ends: 1129 [2025-01-10 00:13:10,028 INFO L226 Difference]: Without dead ends: 1129 [2025-01-10 00:13:10,028 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:13:10,029 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 889 mSDsluCounter, 4827 mSDsCounter, 0 mSdLazyCounter, 3106 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 5450 SdHoareTripleChecker+Invalid, 3125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:10,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 5450 Invalid, 3125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3106 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-10 00:13:10,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2025-01-10 00:13:10,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1125. [2025-01-10 00:13:10,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 859 states have (on average 1.6146682188591386) internal successors, (1387), 1116 states have internal predecessors, (1387), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-01-10 00:13:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1416 transitions. [2025-01-10 00:13:10,045 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1416 transitions. Word has length 98 [2025-01-10 00:13:10,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:10,045 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1416 transitions. [2025-01-10 00:13:10,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 states have internal predecessors, (96), 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:13:10,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1416 transitions. [2025-01-10 00:13:10,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-10 00:13:10,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:10,047 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, 1] [2025-01-10 00:13:10,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 00:13:10,047 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:13:10,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:10,047 INFO L85 PathProgramCache]: Analyzing trace with hash 578350190, now seen corresponding path program 1 times [2025-01-10 00:13:10,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:10,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16322332] [2025-01-10 00:13:10,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:10,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:10,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 00:13:10,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 00:13:10,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:10,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:10,669 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:13:10,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:10,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16322332] [2025-01-10 00:13:10,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16322332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:13:10,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:13:10,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 00:13:10,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810016244] [2025-01-10 00:13:10,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:13:10,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 00:13:10,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:10,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 00:13:10,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-10 00:13:10,672 INFO L87 Difference]: Start difference. First operand 1125 states and 1416 transitions. Second operand has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 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:13:12,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:12,238 INFO L93 Difference]: Finished difference Result 1128 states and 1420 transitions. [2025-01-10 00:13:12,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:13:12,239 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 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 98 [2025-01-10 00:13:12,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:12,242 INFO L225 Difference]: With dead ends: 1128 [2025-01-10 00:13:12,242 INFO L226 Difference]: Without dead ends: 1128 [2025-01-10 00:13:12,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-01-10 00:13:12,242 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 882 mSDsluCounter, 3732 mSDsCounter, 0 mSdLazyCounter, 3210 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 4359 SdHoareTripleChecker+Invalid, 3227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:12,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 4359 Invalid, 3227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3210 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-10 00:13:12,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2025-01-10 00:13:12,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1125. [2025-01-10 00:13:12,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 859 states have (on average 1.6135040745052387) internal successors, (1386), 1116 states have internal predecessors, (1386), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-01-10 00:13:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1415 transitions. [2025-01-10 00:13:12,252 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1415 transitions. Word has length 98 [2025-01-10 00:13:12,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:12,252 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1415 transitions. [2025-01-10 00:13:12,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 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:13:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1415 transitions. [2025-01-10 00:13:12,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-10 00:13:12,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:12,253 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, 1, 1] [2025-01-10 00:13:12,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 00:13:12,253 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:13:12,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:12,254 INFO L85 PathProgramCache]: Analyzing trace with hash -305414997, now seen corresponding path program 1 times [2025-01-10 00:13:12,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:12,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551878577] [2025-01-10 00:13:12,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:12,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:12,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-10 00:13:12,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-10 00:13:12,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:12,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:12,771 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:13:12,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:12,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551878577] [2025-01-10 00:13:12,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551878577] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:13:12,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181871371] [2025-01-10 00:13:12,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:12,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:13:12,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:13:12,774 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:13:12,777 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:13:12,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-10 00:13:13,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-10 00:13:13,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:13,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:13,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-10 00:13:13,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:13:13,049 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:13:13,158 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:13:13,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-10 00:13:13,188 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:13:13,268 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:13:13,402 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:13,403 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:13:13,481 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:13,481 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:13:13,539 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:13,539 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:13:13,554 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:13:13,586 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:13:13,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:13:13,600 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1544) |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:13:13,640 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1543 (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~mem56#1.base| v_ArrVal_1543))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1544)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:13:13,693 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1543 (Array Int Int))) (= (select |c_#valid| (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~mem54#1.base| v_ArrVal_1547))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1543)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1544)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:13:13,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181871371] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:13:13,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:13:13,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2025-01-10 00:13:13,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123521610] [2025-01-10 00:13:13,694 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:13:13,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 00:13:13,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:13,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 00:13:13,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=543, Unknown=14, NotChecked=150, Total=812 [2025-01-10 00:13:13,696 INFO L87 Difference]: Start difference. First operand 1125 states and 1415 transitions. Second operand has 24 states, 21 states have (on average 7.523809523809524) internal successors, (158), 23 states have internal predecessors, (158), 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:13:15,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:15,751 INFO L93 Difference]: Finished difference Result 1127 states and 1419 transitions. [2025-01-10 00:13:15,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 00:13:15,751 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.523809523809524) internal successors, (158), 23 states have internal predecessors, (158), 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 99 [2025-01-10 00:13:15,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:15,753 INFO L225 Difference]: With dead ends: 1127 [2025-01-10 00:13:15,753 INFO L226 Difference]: Without dead ends: 1127 [2025-01-10 00:13:15,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=682, Unknown=14, NotChecked=168, Total=992 [2025-01-10 00:13:15,754 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 860 mSDsluCounter, 7225 mSDsCounter, 0 mSdLazyCounter, 4488 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 7847 SdHoareTripleChecker+Invalid, 4507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:15,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 7847 Invalid, 4507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4488 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-10 00:13:15,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2025-01-10 00:13:15,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1124. [2025-01-10 00:13:15,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 859 states have (on average 1.6123399301513388) internal successors, (1385), 1115 states have internal predecessors, (1385), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-01-10 00:13:15,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1414 transitions. [2025-01-10 00:13:15,767 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1414 transitions. Word has length 99 [2025-01-10 00:13:15,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:15,767 INFO L471 AbstractCegarLoop]: Abstraction has 1124 states and 1414 transitions. [2025-01-10 00:13:15,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.523809523809524) internal successors, (158), 23 states have internal predecessors, (158), 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:13:15,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1414 transitions. [2025-01-10 00:13:15,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-10 00:13:15,770 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:15,770 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, 1, 1] [2025-01-10 00:13:15,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 00:13:15,971 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,SelfDestructingSolverStorable25 [2025-01-10 00:13:15,971 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:13:15,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:15,972 INFO L85 PathProgramCache]: Analyzing trace with hash -305414996, now seen corresponding path program 1 times [2025-01-10 00:13:15,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:15,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679417182] [2025-01-10 00:13:15,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:15,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:16,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-10 00:13:16,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-10 00:13:16,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:16,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:16,836 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:13:16,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:16,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679417182] [2025-01-10 00:13:16,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679417182] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:13:16,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843830818] [2025-01-10 00:13:16,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:16,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:13:16,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:13:16,840 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:13:16,843 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:13:17,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-10 00:13:17,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-10 00:13:17,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:17,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:17,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-10 00:13:17,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:13:17,064 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:13:17,339 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:13:17,339 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:13:17,347 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:13:17,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 00:13:17,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 00:13:17,496 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 00:13:17,496 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 50 treesize of output 45 [2025-01-10 00:13:17,500 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 24 treesize of output 11 [2025-01-10 00:13:17,565 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 00:13:17,565 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 50 treesize of output 45 [2025-01-10 00:13:17,568 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 24 treesize of output 11 [2025-01-10 00:13:17,628 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 00:13:17,628 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 61 treesize of output 54 [2025-01-10 00:13:17,635 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 35 treesize of output 11 [2025-01-10 00:13:17,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-10 00:13:17,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-10 00:13:17,658 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:13:17,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:13:18,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843830818] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:13:18,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:13:18,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2025-01-10 00:13:18,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533138760] [2025-01-10 00:13:18,273 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:13:18,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 00:13:18,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:18,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 00:13:18,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=742, Unknown=16, NotChecked=0, Total=870 [2025-01-10 00:13:18,275 INFO L87 Difference]: Start difference. First operand 1124 states and 1414 transitions. Second operand has 23 states, 20 states have (on average 9.4) internal successors, (188), 23 states have internal predecessors, (188), 2 states have call successors, (2), 1 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:13:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:21,305 INFO L93 Difference]: Finished difference Result 1636 states and 2144 transitions. [2025-01-10 00:13:21,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:13:21,305 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 9.4) internal successors, (188), 23 states have internal predecessors, (188), 2 states have call successors, (2), 1 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 99 [2025-01-10 00:13:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:21,308 INFO L225 Difference]: With dead ends: 1636 [2025-01-10 00:13:21,308 INFO L226 Difference]: Without dead ends: 1636 [2025-01-10 00:13:21,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=194, Invalid=1122, Unknown=16, NotChecked=0, Total=1332 [2025-01-10 00:13:21,309 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 1271 mSDsluCounter, 7712 mSDsCounter, 0 mSdLazyCounter, 6348 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1285 SdHoareTripleChecker+Valid, 8333 SdHoareTripleChecker+Invalid, 6377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 6348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:21,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1285 Valid, 8333 Invalid, 6377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 6348 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-10 00:13:21,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2025-01-10 00:13:21,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1111. [2025-01-10 00:13:21,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 848 states have (on average 1.6179245283018868) internal successors, (1372), 1103 states have internal predecessors, (1372), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 00:13:21,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1400 transitions. [2025-01-10 00:13:21,322 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1400 transitions. Word has length 99 [2025-01-10 00:13:21,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:21,322 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1400 transitions. [2025-01-10 00:13:21,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 9.4) internal successors, (188), 23 states have internal predecessors, (188), 2 states have call successors, (2), 1 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:13:21,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1400 transitions. [2025-01-10 00:13:21,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-10 00:13:21,323 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:21,323 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, 1, 1, 1, 1] [2025-01-10 00:13:21,334 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:13:21,524 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,SelfDestructingSolverStorable26 [2025-01-10 00:13:21,524 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:13:21,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:21,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1777657624, now seen corresponding path program 1 times [2025-01-10 00:13:21,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:21,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398426268] [2025-01-10 00:13:21,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:21,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:21,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-10 00:13:21,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-10 00:13:21,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:21,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:21,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:13:21,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:21,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398426268] [2025-01-10 00:13:21,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398426268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:13:21,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:13:21,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-10 00:13:21,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887960350] [2025-01-10 00:13:21,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:13:21,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:13:21,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:21,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:13:21,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:13:21,988 INFO L87 Difference]: Start difference. First operand 1111 states and 1400 transitions. Second operand has 13 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:13:23,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:23,464 INFO L93 Difference]: Finished difference Result 1130 states and 1422 transitions. [2025-01-10 00:13:23,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:13:23,464 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2025-01-10 00:13:23,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:23,467 INFO L225 Difference]: With dead ends: 1130 [2025-01-10 00:13:23,467 INFO L226 Difference]: Without dead ends: 1130 [2025-01-10 00:13:23,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-01-10 00:13:23,467 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 906 mSDsluCounter, 6029 mSDsCounter, 0 mSdLazyCounter, 3703 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 6654 SdHoareTripleChecker+Invalid, 3722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:23,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 6654 Invalid, 3722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3703 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-10 00:13:23,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2025-01-10 00:13:23,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1126. [2025-01-10 00:13:23,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 862 states have (on average 1.6102088167053363) internal successors, (1388), 1117 states have internal predecessors, (1388), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-01-10 00:13:23,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1417 transitions. [2025-01-10 00:13:23,479 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1417 transitions. Word has length 101 [2025-01-10 00:13:23,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:23,479 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1417 transitions. [2025-01-10 00:13:23,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:13:23,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1417 transitions. [2025-01-10 00:13:23,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-10 00:13:23,480 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:23,480 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, 1, 1, 1, 1] [2025-01-10 00:13:23,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-10 00:13:23,481 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:13:23,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:23,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1777657623, now seen corresponding path program 1 times [2025-01-10 00:13:23,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:23,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625301427] [2025-01-10 00:13:23,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:23,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:23,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-10 00:13:23,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-10 00:13:23,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:23,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:24,189 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:13:24,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:24,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625301427] [2025-01-10 00:13:24,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625301427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:13:24,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:13:24,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-10 00:13:24,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124722774] [2025-01-10 00:13:24,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:13:24,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:13:24,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:24,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:13:24,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:13:24,191 INFO L87 Difference]: Start difference. First operand 1126 states and 1417 transitions. Second operand has 13 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:13:25,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:25,319 INFO L93 Difference]: Finished difference Result 1129 states and 1421 transitions. [2025-01-10 00:13:25,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:13:25,319 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2025-01-10 00:13:25,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:25,322 INFO L225 Difference]: With dead ends: 1129 [2025-01-10 00:13:25,322 INFO L226 Difference]: Without dead ends: 1129 [2025-01-10 00:13:25,322 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:13:25,322 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 883 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 2415 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 3304 SdHoareTripleChecker+Invalid, 2432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:25,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 3304 Invalid, 2432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2415 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-10 00:13:25,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2025-01-10 00:13:25,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1126. [2025-01-10 00:13:25,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 862 states have (on average 1.6090487238979119) internal successors, (1387), 1117 states have internal predecessors, (1387), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-01-10 00:13:25,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1416 transitions. [2025-01-10 00:13:25,334 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1416 transitions. Word has length 101 [2025-01-10 00:13:25,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:25,335 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1416 transitions. [2025-01-10 00:13:25,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:13:25,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1416 transitions. [2025-01-10 00:13:25,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-10 00:13:25,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:25,336 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, 1, 1, 1, 1, 1] [2025-01-10 00:13:25,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-10 00:13:25,336 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:13:25,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:25,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1876789270, now seen corresponding path program 1 times [2025-01-10 00:13:25,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:25,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113028162] [2025-01-10 00:13:25,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:25,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:25,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 00:13:25,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 00:13:25,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:25,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:25,943 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:13:25,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:25,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113028162] [2025-01-10 00:13:25,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113028162] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:13:25,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896586687] [2025-01-10 00:13:25,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:25,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:13:25,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:13:25,946 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:13:25,946 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:13:26,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 00:13:26,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 00:13:26,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:26,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:26,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-10 00:13:26,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:13:26,177 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:13:26,256 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:13:26,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-10 00:13:26,284 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:13:26,361 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:13:26,479 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:26,479 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:13:26,569 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:26,570 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:13:26,617 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:26,617 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:13:26,657 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:26,657 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:13:26,671 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:13:26,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:13:26,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:13:26,752 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2052 (Array Int Int)) (v_ArrVal_2051 (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~mem57#1.base| v_ArrVal_2051))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2052)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:13:30,878 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2052 (Array Int Int)) (v_ArrVal_2051 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2050))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2051)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2052)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:13:30,909 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2052 (Array Int Int)) (v_ArrVal_2051 (Array Int Int))) (= (select |c_#valid| (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~mem54#1.base| v_ArrVal_2055))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2050)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2051)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2052)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:13:30,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896586687] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:13:30,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:13:30,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2025-01-10 00:13:30,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908005146] [2025-01-10 00:13:30,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:13:30,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 00:13:30,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:30,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 00:13:30,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=708, Unknown=44, NotChecked=174, Total=1056 [2025-01-10 00:13:30,912 INFO L87 Difference]: Start difference. First operand 1126 states and 1416 transitions. Second operand has 26 states, 23 states have (on average 7.130434782608695) internal successors, (164), 25 states have internal predecessors, (164), 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:13:33,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:33,074 INFO L93 Difference]: Finished difference Result 1128 states and 1420 transitions. [2025-01-10 00:13:33,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 00:13:33,074 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.130434782608695) internal successors, (164), 25 states have internal predecessors, (164), 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 102 [2025-01-10 00:13:33,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:33,076 INFO L225 Difference]: With dead ends: 1128 [2025-01-10 00:13:33,076 INFO L226 Difference]: Without dead ends: 1128 [2025-01-10 00:13:33,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=153, Invalid=870, Unknown=45, NotChecked=192, Total=1260 [2025-01-10 00:13:33,077 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 857 mSDsluCounter, 6018 mSDsCounter, 0 mSdLazyCounter, 3824 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 6639 SdHoareTripleChecker+Invalid, 3844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:33,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 6639 Invalid, 3844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3824 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-10 00:13:33,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2025-01-10 00:13:33,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1125. [2025-01-10 00:13:33,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 862 states have (on average 1.6078886310904872) internal successors, (1386), 1116 states have internal predecessors, (1386), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-01-10 00:13:33,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1415 transitions. [2025-01-10 00:13:33,085 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1415 transitions. Word has length 102 [2025-01-10 00:13:33,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:33,085 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1415 transitions. [2025-01-10 00:13:33,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.130434782608695) internal successors, (164), 25 states have internal predecessors, (164), 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:13:33,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1415 transitions. [2025-01-10 00:13:33,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-10 00:13:33,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:33,086 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, 1, 1, 1, 1, 1] [2025-01-10 00:13:33,094 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:13:33,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:13:33,287 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:13:33,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:33,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1876789269, now seen corresponding path program 1 times [2025-01-10 00:13:33,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:33,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695543152] [2025-01-10 00:13:33,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:33,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:33,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 00:13:33,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 00:13:33,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:33,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:34,212 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:13:34,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:34,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695543152] [2025-01-10 00:13:34,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695543152] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:13:34,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977437750] [2025-01-10 00:13:34,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:34,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:13:34,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:13:34,215 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:13:34,218 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:13:34,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 00:13:34,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 00:13:34,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:34,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:34,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-10 00:13:34,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:13:34,497 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:13:34,616 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:13:34,616 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:13:34,621 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:13:34,648 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:13:34,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:13:34,811 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:34,811 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 70 treesize of output 65 [2025-01-10 00:13:34,815 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 49 treesize of output 30 [2025-01-10 00:13:34,898 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:34,898 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 70 treesize of output 65 [2025-01-10 00:13:34,901 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 49 treesize of output 30 [2025-01-10 00:13:34,959 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:34,960 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 70 treesize of output 65 [2025-01-10 00:13:34,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2025-01-10 00:13:35,017 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:13:35,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 70 treesize of output 65 [2025-01-10 00:13:35,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 49 treesize of output 30 [2025-01-10 00:13:35,034 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 39 treesize of output 21 [2025-01-10 00:13:35,036 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 32 treesize of output 14 [2025-01-10 00:13:35,056 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:13:35,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:13:35,158 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_2235 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2236 (Array Int Int)) (v_ArrVal_2235 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-01-10 00:13:35,174 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2234 (Array Int Int)) (v_ArrVal_2233 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2234) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2233) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2236 (Array Int Int)) (v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2234 (Array Int Int)) (v_ArrVal_2233 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2233))) (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~mem57#1.base| v_ArrVal_2234) .cse1 v_ArrVal_2235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-01-10 00:13:35,187 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_2236 (Array Int Int)) (v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2234 (Array Int Int)) (v_ArrVal_2233 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2233))) (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_2234) .cse1 v_ArrVal_2235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2234 (Array Int Int)) (v_ArrVal_2233 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2234) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2233) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2025-01-10 00:13:35,213 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2236 (Array Int Int)) (v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2234 (Array Int Int)) (v_ArrVal_2233 (Array Int Int)) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2231 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2232))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2233))) (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~mem56#1.base| v_ArrVal_2231) .cse0 v_ArrVal_2234) .cse1 v_ArrVal_2235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2234 (Array Int Int)) (v_ArrVal_2233 (Array Int Int)) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2231 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2232))) (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~mem56#1.base| v_ArrVal_2231) .cse5 v_ArrVal_2234) (select (select (store .cse6 .cse5 v_ArrVal_2233) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2235))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2025-01-10 00:13:35,245 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |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|) .cse3))) (and (forall ((v_ArrVal_2236 (Array Int Int)) (v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2234 (Array Int Int)) (v_ArrVal_2233 (Array Int Int)) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2231 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2232))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2233))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2231) .cse1 v_ArrVal_2234) .cse2 v_ArrVal_2235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2234 (Array Int Int)) (v_ArrVal_2233 (Array Int Int)) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2231 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2232))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2231) .cse6 v_ArrVal_2234) (select (select (store .cse7 .cse6 v_ArrVal_2233) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2235))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20)))))) is different from false [2025-01-10 00:13:35,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977437750] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:13:35,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:13:35,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2025-01-10 00:13:35,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527684621] [2025-01-10 00:13:35,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:13:35,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-10 00:13:35,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:35,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-10 00:13:35,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=708, Unknown=10, NotChecked=290, Total=1122 [2025-01-10 00:13:35,407 INFO L87 Difference]: Start difference. First operand 1125 states and 1415 transitions. Second operand has 25 states, 22 states have (on average 7.454545454545454) internal successors, (164), 25 states have internal predecessors, (164), 2 states have call successors, (2), 1 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:13:39,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:39,551 INFO L93 Difference]: Finished difference Result 1127 states and 1419 transitions. [2025-01-10 00:13:39,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:13:39,552 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.454545454545454) internal successors, (164), 25 states have internal predecessors, (164), 2 states have call successors, (2), 1 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 102 [2025-01-10 00:13:39,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:39,554 INFO L225 Difference]: With dead ends: 1127 [2025-01-10 00:13:39,554 INFO L226 Difference]: Without dead ends: 1127 [2025-01-10 00:13:39,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=185, Invalid=1085, Unknown=10, NotChecked=360, Total=1640 [2025-01-10 00:13:39,554 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 862 mSDsluCounter, 9042 mSDsCounter, 0 mSdLazyCounter, 7312 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 9663 SdHoareTripleChecker+Invalid, 7333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 7312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:39,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 9663 Invalid, 7333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 7312 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-01-10 00:13:39,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2025-01-10 00:13:39,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1109. [2025-01-10 00:13:39,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 848 states have (on average 1.615566037735849) internal successors, (1370), 1101 states have internal predecessors, (1370), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 00:13:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1398 transitions. [2025-01-10 00:13:39,565 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1398 transitions. Word has length 102 [2025-01-10 00:13:39,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:39,565 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1398 transitions. [2025-01-10 00:13:39,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.454545454545454) internal successors, (164), 25 states have internal predecessors, (164), 2 states have call successors, (2), 1 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:13:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1398 transitions. [2025-01-10 00:13:39,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-10 00:13:39,566 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:39,566 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:13:39,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 00:13:39,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:13:39,767 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:13:39,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:39,767 INFO L85 PathProgramCache]: Analyzing trace with hash -121845910, now seen corresponding path program 1 times [2025-01-10 00:13:39,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:39,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086331166] [2025-01-10 00:13:39,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:39,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:39,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 00:13:39,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 00:13:39,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:39,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:13:40,383 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:13:40,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:13:40,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086331166] [2025-01-10 00:13:40,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086331166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:13:40,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:13:40,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-10 00:13:40,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476922801] [2025-01-10 00:13:40,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:13:40,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:13:40,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:13:40,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:13:40,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:13:40,386 INFO L87 Difference]: Start difference. First operand 1109 states and 1398 transitions. Second operand has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 14 states have internal predecessors, (103), 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:13:42,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:13:42,269 INFO L93 Difference]: Finished difference Result 1132 states and 1424 transitions. [2025-01-10 00:13:42,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:13:42,269 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 14 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2025-01-10 00:13:42,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:13:42,271 INFO L225 Difference]: With dead ends: 1132 [2025-01-10 00:13:42,271 INFO L226 Difference]: Without dead ends: 1132 [2025-01-10 00:13:42,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2025-01-10 00:13:42,272 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 902 mSDsluCounter, 5365 mSDsCounter, 0 mSdLazyCounter, 3436 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 5989 SdHoareTripleChecker+Invalid, 3455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:13:42,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 5989 Invalid, 3455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3436 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-10 00:13:42,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2025-01-10 00:13:42,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1128. [2025-01-10 00:13:42,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 866 states have (on average 1.6050808314087759) internal successors, (1390), 1119 states have internal predecessors, (1390), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-01-10 00:13:42,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1419 transitions. [2025-01-10 00:13:42,283 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1419 transitions. Word has length 105 [2025-01-10 00:13:42,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:13:42,283 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1419 transitions. [2025-01-10 00:13:42,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 14 states have internal predecessors, (103), 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:13:42,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1419 transitions. [2025-01-10 00:13:42,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-10 00:13:42,284 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:13:42,284 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:13:42,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-10 00:13:42,284 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:13:42,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:13:42,284 INFO L85 PathProgramCache]: Analyzing trace with hash -121845909, now seen corresponding path program 1 times [2025-01-10 00:13:42,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:13:42,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742551122] [2025-01-10 00:13:42,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:13:42,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:13:42,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 00:13:42,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 00:13:42,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:13:42,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat