./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-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_JEN_test9-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 8bb47039b70660cfe333b6887d0f99d94255697a030b075b004d2298d7cf4777 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:22:24,303 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:22:24,353 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:22:24,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:22:24,359 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:22:24,382 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:22:24,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:22:24,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:22:24,384 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:22:24,384 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:22:24,385 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:22:24,385 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:22:24,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:22:24,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:22:24,385 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:22:24,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:22:24,386 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:22:24,386 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:22:24,386 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:22:24,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:22:24,386 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:22:24,386 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:22:24,386 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:22:24,386 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:22:24,386 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:22:24,386 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:22:24,386 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:22:24,387 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:22:24,387 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:22:24,387 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:22:24,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:22:24,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:22:24,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:22:24,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:22:24,387 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:22:24,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:22:24,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:22:24,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:22:24,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:22:24,388 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:22:24,388 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:22:24,388 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:22:24,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:22:24,388 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:22:24,388 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:22:24,388 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:22:24,388 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:22:24,388 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 -> 8bb47039b70660cfe333b6887d0f99d94255697a030b075b004d2298d7cf4777 [2025-01-10 00:22:24,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:22:24,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:22:24,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:22:24,625 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:22:24,626 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:22:24,626 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_JEN_test9-1.i [2025-01-10 00:22:25,774 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b40a2b50f/01c5f5f904f94d1789ec3b47e623d08a/FLAG76e14ee16 [2025-01-10 00:22:26,217 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:22:26,220 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-1.i [2025-01-10 00:22:26,246 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b40a2b50f/01c5f5f904f94d1789ec3b47e623d08a/FLAG76e14ee16 [2025-01-10 00:22:26,266 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b40a2b50f/01c5f5f904f94d1789ec3b47e623d08a [2025-01-10 00:22:26,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:22:26,270 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:22:26,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:22:26,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:22:26,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:22:26,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:22:26" (1/1) ... [2025-01-10 00:22:26,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72bb4547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:26, skipping insertion in model container [2025-01-10 00:22:26,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:22:26" (1/1) ... [2025-01-10 00:22:26,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:22:26,723 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:22:26,747 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:22:26,752 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:22:26,755 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:22:26,761 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:22:26,780 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:22:26,782 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:22:26,784 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:22:26,784 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:22:26,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:22:26,802 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:22:26,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:22:26,951 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:22:26,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:26 WrapperNode [2025-01-10 00:22:26,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:22:26,954 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:22:26,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:22:26,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:22:26,959 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:22:26" (1/1) ... [2025-01-10 00:22:26,979 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:22:26" (1/1) ... [2025-01-10 00:22:27,041 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3254 [2025-01-10 00:22:27,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:22:27,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:22:27,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:22:27,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:22:27,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:26" (1/1) ... [2025-01-10 00:22:27,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:26" (1/1) ... [2025-01-10 00:22:27,061 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:26" (1/1) ... [2025-01-10 00:22:27,119 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:22:27,119 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:26" (1/1) ... [2025-01-10 00:22:27,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:26" (1/1) ... [2025-01-10 00:22:27,201 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:26" (1/1) ... [2025-01-10 00:22:27,205 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:26" (1/1) ... [2025-01-10 00:22:27,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:26" (1/1) ... [2025-01-10 00:22:27,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:26" (1/1) ... [2025-01-10 00:22:27,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:26" (1/1) ... [2025-01-10 00:22:27,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:22:27,239 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:22:27,239 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:22:27,239 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:22:27,240 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:26" (1/1) ... [2025-01-10 00:22:27,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:22:27,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:22:27,269 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:22:27,273 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:22:27,289 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-01-10 00:22:27,290 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-01-10 00:22:27,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:22:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:22:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:22:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 00:22:27,291 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 00:22:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:22:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:22:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:22:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 00:22:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 00:22:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-10 00:22:27,292 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 00:22:27,292 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 00:22:27,292 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-10 00:22:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:22:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:22:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:22:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:22:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 00:22:27,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:22:27,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:22:27,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:22:27,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 00:22:27,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:22:27,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:22:27,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:22:27,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:22:27,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:22:27,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:22:27,429 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:22:27,432 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:22:27,454 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:22:27,484 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:22:27,503 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:22:29,955 INFO L? ?]: Removed 1537 outVars from TransFormulas that were not future-live. [2025-01-10 00:22:29,955 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:22:29,993 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:22:29,993 INFO L312 CfgBuilder]: Removed 27 assume(true) statements. [2025-01-10 00:22:29,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:22:29 BoogieIcfgContainer [2025-01-10 00:22:29,994 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:22:29,995 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:22:29,995 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:22:29,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:22:29,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:22:26" (1/3) ... [2025-01-10 00:22:29,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@acd04ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:22:29, skipping insertion in model container [2025-01-10 00:22:29,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:26" (2/3) ... [2025-01-10 00:22:29,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@acd04ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:22:29, skipping insertion in model container [2025-01-10 00:22:30,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:22:29" (3/3) ... [2025-01-10 00:22:30,000 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test9-1.i [2025-01-10 00:22:30,010 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:22:30,011 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test9-1.i that has 6 procedures, 2074 locations, 1 initial locations, 33 loop locations, and 424 error locations. [2025-01-10 00:22:30,083 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:22:30,090 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;@49caa352, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:22:30,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2025-01-10 00:22:30,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 2064 states, 1134 states have (on average 2.005291005291005) internal successors, (2274), 2057 states have internal predecessors, (2274), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2025-01-10 00:22:30,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 00:22:30,100 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:30,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 00:22:30,101 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:22:30,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:30,105 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2025-01-10 00:22:30,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:30,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742697585] [2025-01-10 00:22:30,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:30,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:30,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:22:30,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:22:30,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:30,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:30,257 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:22:30,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:30,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742697585] [2025-01-10 00:22:30,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742697585] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:30,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:30,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:22:30,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296252658] [2025-01-10 00:22:30,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:30,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:22:30,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:30,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:22:30,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:22:30,281 INFO L87 Difference]: Start difference. First operand has 2064 states, 1134 states have (on average 2.005291005291005) internal successors, (2274), 2057 states have internal predecessors, (2274), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) 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:22:31,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:31,552 INFO L93 Difference]: Finished difference Result 2050 states and 3214 transitions. [2025-01-10 00:22:31,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:22:31,554 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:22:31,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:31,585 INFO L225 Difference]: With dead ends: 2050 [2025-01-10 00:22:31,585 INFO L226 Difference]: Without dead ends: 2048 [2025-01-10 00:22:31,586 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:22:31,590 INFO L435 NwaCegarLoop]: 2825 mSDtfsCounter, 2089 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2592 SdHoareTripleChecker+Valid, 2877 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:31,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2592 Valid, 2877 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-10 00:22:31,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2025-01-10 00:22:31,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 2048. [2025-01-10 00:22:31,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2048 states, 1136 states have (on average 1.9401408450704225) internal successors, (2204), 2041 states have internal predecessors, (2204), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-01-10 00:22:31,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 3212 transitions. [2025-01-10 00:22:31,819 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 3212 transitions. Word has length 3 [2025-01-10 00:22:31,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:31,820 INFO L471 AbstractCegarLoop]: Abstraction has 2048 states and 3212 transitions. [2025-01-10 00:22:31,820 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:22:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 3212 transitions. [2025-01-10 00:22:31,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 00:22:31,820 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:31,820 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 00:22:31,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:22:31,821 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:22:31,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:31,821 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2025-01-10 00:22:31,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:31,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456737849] [2025-01-10 00:22:31,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:31,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:31,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:22:31,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:22:31,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:31,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:31,886 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:22:31,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:31,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456737849] [2025-01-10 00:22:31,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456737849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:31,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:31,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:22:31,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212474281] [2025-01-10 00:22:31,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:31,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:22:31,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:31,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:22:31,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:22:31,888 INFO L87 Difference]: Start difference. First operand 2048 states and 3212 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:22:32,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:32,999 INFO L93 Difference]: Finished difference Result 3811 states and 6127 transitions. [2025-01-10 00:22:32,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:22:32,999 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:22:32,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:33,014 INFO L225 Difference]: With dead ends: 3811 [2025-01-10 00:22:33,014 INFO L226 Difference]: Without dead ends: 3811 [2025-01-10 00:22:33,014 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:22:33,015 INFO L435 NwaCegarLoop]: 2927 mSDtfsCounter, 1907 mSDsluCounter, 2278 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2409 SdHoareTripleChecker+Valid, 5205 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:33,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2409 Valid, 5205 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-10 00:22:33,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3811 states. [2025-01-10 00:22:33,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3811 to 3547. [2025-01-10 00:22:33,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3547 states, 2136 states have (on average 1.921816479400749) internal successors, (4105), 3538 states have internal predecessors, (4105), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-01-10 00:22:33,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3547 states to 3547 states and 6117 transitions. [2025-01-10 00:22:33,267 INFO L78 Accepts]: Start accepts. Automaton has 3547 states and 6117 transitions. Word has length 3 [2025-01-10 00:22:33,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:33,267 INFO L471 AbstractCegarLoop]: Abstraction has 3547 states and 6117 transitions. [2025-01-10 00:22:33,267 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:22:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3547 states and 6117 transitions. [2025-01-10 00:22:33,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 00:22:33,267 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:33,267 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:22:33,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:22:33,268 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:22:33,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:33,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1743988334, now seen corresponding path program 1 times [2025-01-10 00:22:33,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:33,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937350209] [2025-01-10 00:22:33,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:33,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:33,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:22:33,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:22:33,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:33,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:33,320 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:22:33,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:33,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937350209] [2025-01-10 00:22:33,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937350209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:33,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:33,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:22:33,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157007922] [2025-01-10 00:22:33,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:33,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:22:33,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:33,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:22:33,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:22:33,322 INFO L87 Difference]: Start difference. First operand 3547 states and 6117 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:22:34,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:34,301 INFO L93 Difference]: Finished difference Result 4810 states and 8434 transitions. [2025-01-10 00:22:34,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:22:34,301 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:22:34,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:34,324 INFO L225 Difference]: With dead ends: 4810 [2025-01-10 00:22:34,324 INFO L226 Difference]: Without dead ends: 4810 [2025-01-10 00:22:34,325 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:22:34,325 INFO L435 NwaCegarLoop]: 4985 mSDtfsCounter, 2074 mSDsluCounter, 2305 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2577 SdHoareTripleChecker+Valid, 7290 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:34,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2577 Valid, 7290 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-10 00:22:34,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2025-01-10 00:22:34,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 3500. [2025-01-10 00:22:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3500 states, 2136 states have (on average 1.8885767790262171) internal successors, (4034), 3491 states have internal predecessors, (4034), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-01-10 00:22:34,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3500 states to 3500 states and 6046 transitions. [2025-01-10 00:22:34,604 INFO L78 Accepts]: Start accepts. Automaton has 3500 states and 6046 transitions. Word has length 9 [2025-01-10 00:22:34,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:34,605 INFO L471 AbstractCegarLoop]: Abstraction has 3500 states and 6046 transitions. [2025-01-10 00:22:34,605 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:22:34,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3500 states and 6046 transitions. [2025-01-10 00:22:34,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 00:22:34,605 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:34,605 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:22:34,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:22:34,605 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:22:34,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:34,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1743988333, now seen corresponding path program 1 times [2025-01-10 00:22:34,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:34,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919708345] [2025-01-10 00:22:34,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:34,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:34,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:22:34,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:22:34,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:34,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:34,740 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:22:34,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:34,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919708345] [2025-01-10 00:22:34,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919708345] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:34,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:34,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:22:34,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249216882] [2025-01-10 00:22:34,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:34,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:22:34,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:34,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:22:34,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:22:34,742 INFO L87 Difference]: Start difference. First operand 3500 states and 6046 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:22:35,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:35,897 INFO L93 Difference]: Finished difference Result 6020 states and 10782 transitions. [2025-01-10 00:22:35,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:22:35,898 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:22:35,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:35,922 INFO L225 Difference]: With dead ends: 6020 [2025-01-10 00:22:35,922 INFO L226 Difference]: Without dead ends: 6020 [2025-01-10 00:22:35,923 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:22:35,924 INFO L435 NwaCegarLoop]: 5120 mSDtfsCounter, 1867 mSDsluCounter, 2421 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2369 SdHoareTripleChecker+Valid, 7541 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:35,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2369 Valid, 7541 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-10 00:22:35,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2025-01-10 00:22:36,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3475. [2025-01-10 00:22:36,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3475 states, 2136 states have (on average 1.8656367041198503) internal successors, (3985), 3466 states have internal predecessors, (3985), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-01-10 00:22:36,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3475 states to 3475 states and 5997 transitions. [2025-01-10 00:22:36,277 INFO L78 Accepts]: Start accepts. Automaton has 3475 states and 5997 transitions. Word has length 9 [2025-01-10 00:22:36,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:36,278 INFO L471 AbstractCegarLoop]: Abstraction has 3475 states and 5997 transitions. [2025-01-10 00:22:36,278 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:22:36,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3475 states and 5997 transitions. [2025-01-10 00:22:36,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 00:22:36,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:36,279 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:22:36,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:22:36,279 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr422ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:22:36,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:36,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1259420379, now seen corresponding path program 1 times [2025-01-10 00:22:36,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:36,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528775596] [2025-01-10 00:22:36,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:36,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:36,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:22:36,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:22:36,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:36,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:36,359 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:22:36,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:36,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528775596] [2025-01-10 00:22:36,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528775596] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:36,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:36,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:22:36,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232026705] [2025-01-10 00:22:36,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:36,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:22:36,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:36,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:22:36,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:22:36,361 INFO L87 Difference]: Start difference. First operand 3475 states and 5997 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:22:36,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:36,969 INFO L93 Difference]: Finished difference Result 6636 states and 11492 transitions. [2025-01-10 00:22:36,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:22:36,970 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:22:36,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:37,021 INFO L225 Difference]: With dead ends: 6636 [2025-01-10 00:22:37,024 INFO L226 Difference]: Without dead ends: 6636 [2025-01-10 00:22:37,024 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:22:37,024 INFO L435 NwaCegarLoop]: 3141 mSDtfsCounter, 2088 mSDsluCounter, 5714 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2591 SdHoareTripleChecker+Valid, 8855 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:37,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2591 Valid, 8855 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 00:22:37,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6636 states. [2025-01-10 00:22:37,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6636 to 3477. [2025-01-10 00:22:37,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3477 states, 2138 states have (on average 1.864826941066417) internal successors, (3987), 3468 states have internal predecessors, (3987), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-01-10 00:22:37,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3477 states to 3477 states and 5999 transitions. [2025-01-10 00:22:37,387 INFO L78 Accepts]: Start accepts. Automaton has 3477 states and 5999 transitions. Word has length 10 [2025-01-10 00:22:37,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:37,387 INFO L471 AbstractCegarLoop]: Abstraction has 3477 states and 5999 transitions. [2025-01-10 00:22:37,387 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:22:37,387 INFO L276 IsEmpty]: Start isEmpty. Operand 3477 states and 5999 transitions. [2025-01-10 00:22:37,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 00:22:37,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:37,387 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:22:37,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:22:37,387 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:22:37,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:37,388 INFO L85 PathProgramCache]: Analyzing trace with hash 495194974, now seen corresponding path program 1 times [2025-01-10 00:22:37,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:37,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035251030] [2025-01-10 00:22:37,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:37,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:37,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:22:37,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:22:37,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:37,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:37,451 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:22:37,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:37,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035251030] [2025-01-10 00:22:37,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035251030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:37,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:37,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:22:37,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810130453] [2025-01-10 00:22:37,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:37,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:22:37,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:37,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:22:37,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:22:37,453 INFO L87 Difference]: Start difference. First operand 3477 states and 5999 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:22:39,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:39,217 INFO L93 Difference]: Finished difference Result 3553 states and 6106 transitions. [2025-01-10 00:22:39,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:22:39,218 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:22:39,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:39,226 INFO L225 Difference]: With dead ends: 3553 [2025-01-10 00:22:39,226 INFO L226 Difference]: Without dead ends: 3553 [2025-01-10 00:22:39,226 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:22:39,227 INFO L435 NwaCegarLoop]: 2727 mSDtfsCounter, 2338 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 2295 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2841 SdHoareTripleChecker+Valid, 4328 SdHoareTripleChecker+Invalid, 2323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:39,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2841 Valid, 4328 Invalid, 2323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2295 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-10 00:22:39,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3553 states. [2025-01-10 00:22:39,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3553 to 3454. [2025-01-10 00:22:39,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3454 states, 2138 states have (on average 1.843311506080449) internal successors, (3941), 3445 states have internal predecessors, (3941), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-01-10 00:22:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 5953 transitions. [2025-01-10 00:22:39,405 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 5953 transitions. Word has length 19 [2025-01-10 00:22:39,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:39,406 INFO L471 AbstractCegarLoop]: Abstraction has 3454 states and 5953 transitions. [2025-01-10 00:22:39,406 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:22:39,406 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 5953 transitions. [2025-01-10 00:22:39,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 00:22:39,407 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:39,407 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:22:39,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:22:39,407 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:22:39,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:39,409 INFO L85 PathProgramCache]: Analyzing trace with hash 495194975, now seen corresponding path program 1 times [2025-01-10 00:22:39,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:39,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438924289] [2025-01-10 00:22:39,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:39,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:39,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:22:39,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:22:39,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:39,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:39,490 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:22:39,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:39,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438924289] [2025-01-10 00:22:39,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438924289] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:39,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:39,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:22:39,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659587956] [2025-01-10 00:22:39,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:39,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:22:39,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:39,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:22:39,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:22:39,493 INFO L87 Difference]: Start difference. First operand 3454 states and 5953 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:22:39,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:39,521 INFO L93 Difference]: Finished difference Result 3316 states and 5747 transitions. [2025-01-10 00:22:39,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:22:39,521 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:22:39,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:39,527 INFO L225 Difference]: With dead ends: 3316 [2025-01-10 00:22:39,527 INFO L226 Difference]: Without dead ends: 3316 [2025-01-10 00:22:39,527 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:22:39,528 INFO L435 NwaCegarLoop]: 2993 mSDtfsCounter, 60 mSDsluCounter, 2940 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 5933 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:22:39,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 5933 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:22:39,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3316 states. [2025-01-10 00:22:39,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3316 to 3316. [2025-01-10 00:22:39,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3316 states, 2012 states have (on average 1.856361829025845) internal successors, (3735), 3307 states have internal predecessors, (3735), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-01-10 00:22:39,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3316 states to 3316 states and 5747 transitions. [2025-01-10 00:22:39,676 INFO L78 Accepts]: Start accepts. Automaton has 3316 states and 5747 transitions. Word has length 19 [2025-01-10 00:22:39,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:39,676 INFO L471 AbstractCegarLoop]: Abstraction has 3316 states and 5747 transitions. [2025-01-10 00:22:39,676 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:22:39,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3316 states and 5747 transitions. [2025-01-10 00:22:39,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 00:22:39,677 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:39,677 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:22:39,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:22:39,677 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:22:39,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:39,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1828609380, now seen corresponding path program 1 times [2025-01-10 00:22:39,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:39,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432529177] [2025-01-10 00:22:39,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:39,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:39,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:22:39,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:22:39,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:39,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:39,782 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:22:39,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:39,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432529177] [2025-01-10 00:22:39,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432529177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:39,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:39,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:22:39,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367838826] [2025-01-10 00:22:39,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:39,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:22:39,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:39,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:22:39,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:22:39,785 INFO L87 Difference]: Start difference. First operand 3316 states and 5747 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:22:39,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:39,839 INFO L93 Difference]: Finished difference Result 3287 states and 5697 transitions. [2025-01-10 00:22:39,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:22:39,840 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:22:39,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:39,846 INFO L225 Difference]: With dead ends: 3287 [2025-01-10 00:22:39,847 INFO L226 Difference]: Without dead ends: 3287 [2025-01-10 00:22:39,847 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:22:39,848 INFO L435 NwaCegarLoop]: 2958 mSDtfsCounter, 41 mSDsluCounter, 5888 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 8846 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:22:39,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 8846 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:22:39,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3287 states. [2025-01-10 00:22:39,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3287 to 3281. [2025-01-10 00:22:39,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3281 states, 1984 states have (on average 1.8543346774193548) internal successors, (3679), 3272 states have internal predecessors, (3679), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-01-10 00:22:39,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3281 states to 3281 states and 5691 transitions. [2025-01-10 00:22:39,999 INFO L78 Accepts]: Start accepts. Automaton has 3281 states and 5691 transitions. Word has length 20 [2025-01-10 00:22:40,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:40,000 INFO L471 AbstractCegarLoop]: Abstraction has 3281 states and 5691 transitions. [2025-01-10 00:22:40,000 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:22:40,000 INFO L276 IsEmpty]: Start isEmpty. Operand 3281 states and 5691 transitions. [2025-01-10 00:22:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 00:22:40,001 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:40,001 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:22:40,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:22:40,001 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:22:40,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:40,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1048342954, now seen corresponding path program 1 times [2025-01-10 00:22:40,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:40,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977223311] [2025-01-10 00:22:40,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:40,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:40,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 00:22:40,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 00:22:40,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:40,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:40,151 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:22:40,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:40,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977223311] [2025-01-10 00:22:40,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977223311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:40,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:40,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:22:40,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953017641] [2025-01-10 00:22:40,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:40,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:22:40,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:40,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:22:40,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:22:40,152 INFO L87 Difference]: Start difference. First operand 3281 states and 5691 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:22:42,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:42,140 INFO L93 Difference]: Finished difference Result 6055 states and 10800 transitions. [2025-01-10 00:22:42,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:22:42,141 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:22:42,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:42,152 INFO L225 Difference]: With dead ends: 6055 [2025-01-10 00:22:42,153 INFO L226 Difference]: Without dead ends: 6055 [2025-01-10 00:22:42,153 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:22:42,154 INFO L435 NwaCegarLoop]: 2796 mSDtfsCounter, 1816 mSDsluCounter, 3578 mSDsCounter, 0 mSdLazyCounter, 2359 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2316 SdHoareTripleChecker+Valid, 6374 SdHoareTripleChecker+Invalid, 2362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:42,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2316 Valid, 6374 Invalid, 2362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2359 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-10 00:22:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6055 states. [2025-01-10 00:22:42,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6055 to 3277. [2025-01-10 00:22:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3277 states, 1984 states have (on average 1.8503024193548387) internal successors, (3671), 3268 states have internal predecessors, (3671), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-01-10 00:22:42,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3277 states to 3277 states and 5683 transitions. [2025-01-10 00:22:42,536 INFO L78 Accepts]: Start accepts. Automaton has 3277 states and 5683 transitions. Word has length 34 [2025-01-10 00:22:42,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:42,536 INFO L471 AbstractCegarLoop]: Abstraction has 3277 states and 5683 transitions. [2025-01-10 00:22:42,536 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:22:42,536 INFO L276 IsEmpty]: Start isEmpty. Operand 3277 states and 5683 transitions. [2025-01-10 00:22:42,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-10 00:22:42,538 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:42,539 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:22:42,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:22:42,539 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:22:42,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:42,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1085651552, now seen corresponding path program 1 times [2025-01-10 00:22:42,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:42,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532297339] [2025-01-10 00:22:42,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:42,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:42,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 00:22:42,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 00:22:42,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:42,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:42,650 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:22:42,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:42,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532297339] [2025-01-10 00:22:42,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532297339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:42,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:42,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:22:42,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137919489] [2025-01-10 00:22:42,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:42,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:22:42,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:42,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:22:42,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:22:42,651 INFO L87 Difference]: Start difference. First operand 3277 states and 5683 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:22:42,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:42,710 INFO L93 Difference]: Finished difference Result 3277 states and 5675 transitions. [2025-01-10 00:22:42,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:22:42,711 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:22:42,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:42,717 INFO L225 Difference]: With dead ends: 3277 [2025-01-10 00:22:42,717 INFO L226 Difference]: Without dead ends: 3277 [2025-01-10 00:22:42,717 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:22:42,718 INFO L435 NwaCegarLoop]: 2953 mSDtfsCounter, 21 mSDsluCounter, 5875 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8828 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:22:42,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8828 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:22:42,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3277 states. [2025-01-10 00:22:42,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3277 to 3277. [2025-01-10 00:22:42,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3277 states, 1984 states have (on average 1.8462701612903225) internal successors, (3663), 3268 states have internal predecessors, (3663), 1007 states have call successors, (1007), 3 states have call predecessors, (1007), 2 states have return successors, (1005), 7 states have call predecessors, (1005), 1005 states have call successors, (1005) [2025-01-10 00:22:42,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3277 states to 3277 states and 5675 transitions. [2025-01-10 00:22:42,907 INFO L78 Accepts]: Start accepts. Automaton has 3277 states and 5675 transitions. Word has length 68 [2025-01-10 00:22:42,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:42,907 INFO L471 AbstractCegarLoop]: Abstraction has 3277 states and 5675 transitions. [2025-01-10 00:22:42,907 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:22:42,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3277 states and 5675 transitions. [2025-01-10 00:22:42,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-10 00:22:42,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:42,908 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:22:42,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:22:42,908 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:22:42,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:42,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1491712468, now seen corresponding path program 1 times [2025-01-10 00:22:42,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:42,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658981458] [2025-01-10 00:22:42,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:42,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:42,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-10 00:22:42,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-10 00:22:42,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:42,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:42,987 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:22:42,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:42,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658981458] [2025-01-10 00:22:42,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658981458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:42,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:42,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:22:42,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073164884] [2025-01-10 00:22:42,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:42,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:22:42,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:42,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:22:42,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:22:42,989 INFO L87 Difference]: Start difference. First operand 3277 states and 5675 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:22:43,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:43,055 INFO L93 Difference]: Finished difference Result 5785 states and 10395 transitions. [2025-01-10 00:22:43,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:22:43,055 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:22:43,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:43,065 INFO L225 Difference]: With dead ends: 5785 [2025-01-10 00:22:43,065 INFO L226 Difference]: Without dead ends: 5785 [2025-01-10 00:22:43,066 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:22:43,066 INFO L435 NwaCegarLoop]: 3260 mSDtfsCounter, 1353 mSDsluCounter, 2922 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1853 SdHoareTripleChecker+Valid, 6182 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:22:43,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1853 Valid, 6182 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:22:43,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5785 states. [2025-01-10 00:22:43,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5785 to 5728. [2025-01-10 00:22:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5728 states, 3435 states have (on average 1.8573508005822417) internal successors, (6380), 5719 states have internal predecessors, (6380), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2025-01-10 00:22:43,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5728 states to 5728 states and 10392 transitions. [2025-01-10 00:22:43,357 INFO L78 Accepts]: Start accepts. Automaton has 5728 states and 10392 transitions. Word has length 76 [2025-01-10 00:22:43,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:43,357 INFO L471 AbstractCegarLoop]: Abstraction has 5728 states and 10392 transitions. [2025-01-10 00:22:43,357 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:22:43,357 INFO L276 IsEmpty]: Start isEmpty. Operand 5728 states and 10392 transitions. [2025-01-10 00:22:43,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-10 00:22:43,360 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:43,360 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:22:43,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:22:43,360 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:22:43,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:43,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1497079487, now seen corresponding path program 1 times [2025-01-10 00:22:43,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:43,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575553358] [2025-01-10 00:22:43,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:43,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:43,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-10 00:22:43,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 00:22:43,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:43,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:43,601 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:22:43,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:43,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575553358] [2025-01-10 00:22:43,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575553358] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:43,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:43,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:22:43,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348496733] [2025-01-10 00:22:43,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:43,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:22:43,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:43,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:22:43,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:22:43,603 INFO L87 Difference]: Start difference. First operand 5728 states and 10392 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:22:44,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:44,195 INFO L93 Difference]: Finished difference Result 5727 states and 10390 transitions. [2025-01-10 00:22:44,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:22:44,196 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:22:44,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:44,208 INFO L225 Difference]: With dead ends: 5727 [2025-01-10 00:22:44,208 INFO L226 Difference]: Without dead ends: 5727 [2025-01-10 00:22:44,209 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:22:44,209 INFO L435 NwaCegarLoop]: 2963 mSDtfsCounter, 2 mSDsluCounter, 7898 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10861 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:44,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10861 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 00:22:44,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5727 states. [2025-01-10 00:22:44,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5727 to 5727. [2025-01-10 00:22:44,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5727 states, 3435 states have (on average 1.8567685589519651) internal successors, (6378), 5718 states have internal predecessors, (6378), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2025-01-10 00:22:44,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5727 states to 5727 states and 10390 transitions. [2025-01-10 00:22:44,491 INFO L78 Accepts]: Start accepts. Automaton has 5727 states and 10390 transitions. Word has length 84 [2025-01-10 00:22:44,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:44,491 INFO L471 AbstractCegarLoop]: Abstraction has 5727 states and 10390 transitions. [2025-01-10 00:22:44,491 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:22:44,492 INFO L276 IsEmpty]: Start isEmpty. Operand 5727 states and 10390 transitions. [2025-01-10 00:22:44,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-10 00:22:44,493 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:44,493 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:22:44,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:22:44,493 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:22:44,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:44,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1497079488, now seen corresponding path program 1 times [2025-01-10 00:22:44,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:44,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394341720] [2025-01-10 00:22:44,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:44,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:44,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-10 00:22:44,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 00:22:44,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:44,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:44,866 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:22:44,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:44,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394341720] [2025-01-10 00:22:44,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394341720] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:44,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:44,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:22:44,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060447072] [2025-01-10 00:22:44,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:44,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:22:44,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:44,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:22:44,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:22:44,868 INFO L87 Difference]: Start difference. First operand 5727 states and 10390 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:22:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:45,450 INFO L93 Difference]: Finished difference Result 5726 states and 10388 transitions. [2025-01-10 00:22:45,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:22:45,451 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:22:45,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:45,462 INFO L225 Difference]: With dead ends: 5726 [2025-01-10 00:22:45,463 INFO L226 Difference]: Without dead ends: 5726 [2025-01-10 00:22:45,463 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:22:45,464 INFO L435 NwaCegarLoop]: 2963 mSDtfsCounter, 1 mSDsluCounter, 7836 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10799 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:45,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10799 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 00:22:45,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5726 states. [2025-01-10 00:22:45,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5726 to 5726. [2025-01-10 00:22:45,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5726 states, 3433 states have (on average 1.8572676958928052) internal successors, (6376), 5717 states have internal predecessors, (6376), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 2 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2025-01-10 00:22:45,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5726 states to 5726 states and 10388 transitions. [2025-01-10 00:22:45,734 INFO L78 Accepts]: Start accepts. Automaton has 5726 states and 10388 transitions. Word has length 84 [2025-01-10 00:22:45,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:45,735 INFO L471 AbstractCegarLoop]: Abstraction has 5726 states and 10388 transitions. [2025-01-10 00:22:45,735 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:22:45,735 INFO L276 IsEmpty]: Start isEmpty. Operand 5726 states and 10388 transitions. [2025-01-10 00:22:45,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-10 00:22:45,736 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:45,736 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:22:45,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:22:45,736 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:22:45,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:45,738 INFO L85 PathProgramCache]: Analyzing trace with hash -190598426, now seen corresponding path program 1 times [2025-01-10 00:22:45,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:45,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619615199] [2025-01-10 00:22:45,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:45,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:45,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-10 00:22:45,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 00:22:45,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:45,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:45,964 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:22:45,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:45,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619615199] [2025-01-10 00:22:45,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619615199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:45,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:45,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:22:45,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267597785] [2025-01-10 00:22:45,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:45,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:22:45,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:45,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:22:45,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:22:45,967 INFO L87 Difference]: Start difference. First operand 5726 states and 10388 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:22:49,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:49,166 INFO L93 Difference]: Finished difference Result 5744 states and 10414 transitions. [2025-01-10 00:22:49,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:22:49,167 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:22:49,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:49,183 INFO L225 Difference]: With dead ends: 5744 [2025-01-10 00:22:49,183 INFO L226 Difference]: Without dead ends: 5744 [2025-01-10 00:22:49,183 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:22:49,183 INFO L435 NwaCegarLoop]: 2948 mSDtfsCounter, 13 mSDsluCounter, 10014 mSDsCounter, 0 mSdLazyCounter, 4318 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 12962 SdHoareTripleChecker+Invalid, 4823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 4318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:49,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 12962 Invalid, 4823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [505 Valid, 4318 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-10 00:22:49,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5744 states. [2025-01-10 00:22:49,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5744 to 5735. [2025-01-10 00:22:49,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5735 states, 3441 states have (on average 1.856146469049695) internal successors, (6387), 5724 states have internal predecessors, (6387), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 3 states have return successors, (2010), 11 states have call predecessors, (2010), 2005 states have call successors, (2010) [2025-01-10 00:22:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5735 states to 5735 states and 10404 transitions. [2025-01-10 00:22:49,514 INFO L78 Accepts]: Start accepts. Automaton has 5735 states and 10404 transitions. Word has length 92 [2025-01-10 00:22:49,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:49,514 INFO L471 AbstractCegarLoop]: Abstraction has 5735 states and 10404 transitions. [2025-01-10 00:22:49,514 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:22:49,514 INFO L276 IsEmpty]: Start isEmpty. Operand 5735 states and 10404 transitions. [2025-01-10 00:22:49,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-10 00:22:49,515 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:49,515 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:22:49,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:22:49,515 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:22:49,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:49,516 INFO L85 PathProgramCache]: Analyzing trace with hash -190598425, now seen corresponding path program 1 times [2025-01-10 00:22:49,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:49,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915933332] [2025-01-10 00:22:49,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:49,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:49,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-10 00:22:49,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 00:22:49,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:49,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:49,902 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:22:49,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:49,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915933332] [2025-01-10 00:22:49,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915933332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:49,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:49,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:22:49,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114908244] [2025-01-10 00:22:49,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:49,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:22:49,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:49,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:22:49,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:22:49,904 INFO L87 Difference]: Start difference. First operand 5735 states and 10404 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:22:52,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:52,675 INFO L93 Difference]: Finished difference Result 5735 states and 10402 transitions. [2025-01-10 00:22:52,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:22:52,676 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:22:52,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:52,688 INFO L225 Difference]: With dead ends: 5735 [2025-01-10 00:22:52,688 INFO L226 Difference]: Without dead ends: 5735 [2025-01-10 00:22:52,689 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:22:52,689 INFO L435 NwaCegarLoop]: 2952 mSDtfsCounter, 8 mSDsluCounter, 8150 mSDsCounter, 0 mSdLazyCounter, 3209 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 11102 SdHoareTripleChecker+Invalid, 3712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 3209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:52,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 11102 Invalid, 3712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 3209 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-10 00:22:52,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5735 states. [2025-01-10 00:22:52,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5735 to 5735. [2025-01-10 00:22:53,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5735 states, 3441 states have (on average 1.8555652426620168) internal successors, (6385), 5724 states have internal predecessors, (6385), 2007 states have call successors, (2007), 3 states have call predecessors, (2007), 3 states have return successors, (2010), 11 states have call predecessors, (2010), 2005 states have call successors, (2010) [2025-01-10 00:22:53,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5735 states to 5735 states and 10402 transitions. [2025-01-10 00:22:53,010 INFO L78 Accepts]: Start accepts. Automaton has 5735 states and 10402 transitions. Word has length 92 [2025-01-10 00:22:53,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:53,011 INFO L471 AbstractCegarLoop]: Abstraction has 5735 states and 10402 transitions. [2025-01-10 00:22:53,011 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:22:53,011 INFO L276 IsEmpty]: Start isEmpty. Operand 5735 states and 10402 transitions. [2025-01-10 00:22:53,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-10 00:22:53,011 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:53,011 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:22:53,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:22:53,012 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:22:53,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:53,013 INFO L85 PathProgramCache]: Analyzing trace with hash 596220336, now seen corresponding path program 1 times [2025-01-10 00:22:53,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:53,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471594217] [2025-01-10 00:22:53,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:53,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:53,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 00:22:53,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 00:22:53,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:53,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:53,372 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:22:53,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:53,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471594217] [2025-01-10 00:22:53,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471594217] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:22:53,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72563860] [2025-01-10 00:22:53,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:53,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:22:53,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:22:53,378 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:22:53,381 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:22:53,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 00:22:53,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 00:22:53,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:53,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:53,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 00:22:53,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:22:53,562 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:22:53,668 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:22:53,668 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:22:53,701 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:22:53,768 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:22:53,906 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:22:53,906 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:22:53,938 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:22:53,964 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:22:53,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:22:54,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72563860] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:22:54,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:22:54,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2025-01-10 00:22:54,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572942717] [2025-01-10 00:22:54,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:22:54,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 00:22:54,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:54,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 00:22:54,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=319, Unknown=5, NotChecked=0, Total=380 [2025-01-10 00:22:54,018 INFO L87 Difference]: Start difference. First operand 5735 states and 10402 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:23:03,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:03,770 INFO L93 Difference]: Finished difference Result 5742 states and 10408 transitions. [2025-01-10 00:23:03,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:23:03,776 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:23:03,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:03,796 INFO L225 Difference]: With dead ends: 5742 [2025-01-10 00:23:03,799 INFO L226 Difference]: Without dead ends: 5742 [2025-01-10 00:23:03,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=464, Unknown=5, NotChecked=0, Total=552 [2025-01-10 00:23:03,801 INFO L435 NwaCegarLoop]: 2616 mSDtfsCounter, 1871 mSDsluCounter, 20715 mSDsCounter, 0 mSdLazyCounter, 15216 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2375 SdHoareTripleChecker+Valid, 23331 SdHoareTripleChecker+Invalid, 15731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 15216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:03,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2375 Valid, 23331 Invalid, 15731 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [515 Valid, 15216 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2025-01-10 00:23:03,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5742 states. [2025-01-10 00:23:04,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5742 to 5739. [2025-01-10 00:23:04,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5739 states, 3445 states have (on average 1.8542815674891147) internal successors, (6388), 5727 states have internal predecessors, (6388), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2025-01-10 00:23:04,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5739 states to 5739 states and 10402 transitions. [2025-01-10 00:23:04,270 INFO L78 Accepts]: Start accepts. Automaton has 5739 states and 10402 transitions. Word has length 93 [2025-01-10 00:23:04,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:04,270 INFO L471 AbstractCegarLoop]: Abstraction has 5739 states and 10402 transitions. [2025-01-10 00:23:04,270 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:23:04,270 INFO L276 IsEmpty]: Start isEmpty. Operand 5739 states and 10402 transitions. [2025-01-10 00:23:04,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-10 00:23:04,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:04,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, 1] [2025-01-10 00:23:04,282 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:23:04,475 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,SelfDestructingSolverStorable15 [2025-01-10 00:23:04,475 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:23:04,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:04,477 INFO L85 PathProgramCache]: Analyzing trace with hash 596220337, now seen corresponding path program 1 times [2025-01-10 00:23:04,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:04,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533328755] [2025-01-10 00:23:04,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:04,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:04,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 00:23:04,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 00:23:04,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:04,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:05,160 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:23:05,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:05,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533328755] [2025-01-10 00:23:05,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533328755] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:05,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285643296] [2025-01-10 00:23:05,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:05,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:23:05,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:23:05,164 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:23:05,165 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:23:05,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 00:23:05,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 00:23:05,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:05,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:05,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 00:23:05,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:23:05,402 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:23:05,493 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:23:05,493 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:23:05,498 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:23:05,521 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:23:05,524 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:23:05,589 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:23:05,592 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:23:05,673 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:05,674 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:23:05,677 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:23:05,706 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:23:05,712 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:23:05,725 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:23:05,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:23:05,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285643296] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:05,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:23:05,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2025-01-10 00:23:05,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487650559] [2025-01-10 00:23:05,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:23:05,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 00:23:05,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:05,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 00:23:05,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=344, Unknown=15, NotChecked=0, Total=420 [2025-01-10 00:23:05,839 INFO L87 Difference]: Start difference. First operand 5739 states and 10402 transitions. Second operand has 18 states, 15 states have (on average 9.733333333333333) 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:23:13,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:13,424 INFO L93 Difference]: Finished difference Result 5741 states and 10406 transitions. [2025-01-10 00:23:13,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:23:13,424 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.733333333333333) 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:23:13,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:13,447 INFO L225 Difference]: With dead ends: 5741 [2025-01-10 00:23:13,447 INFO L226 Difference]: Without dead ends: 5741 [2025-01-10 00:23:13,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=489, Unknown=16, NotChecked=0, Total=600 [2025-01-10 00:23:13,452 INFO L435 NwaCegarLoop]: 2619 mSDtfsCounter, 1877 mSDsluCounter, 15037 mSDsCounter, 0 mSdLazyCounter, 9562 mSolverCounterSat, 1023 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2381 SdHoareTripleChecker+Valid, 17656 SdHoareTripleChecker+Invalid, 10585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1023 IncrementalHoareTripleChecker+Valid, 9562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:13,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2381 Valid, 17656 Invalid, 10585 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1023 Valid, 9562 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2025-01-10 00:23:13,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5741 states. [2025-01-10 00:23:13,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5741 to 5729. [2025-01-10 00:23:13,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5729 states, 3437 states have (on average 1.8553971486761711) internal successors, (6377), 5719 states have internal predecessors, (6377), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 3 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2025-01-10 00:23:13,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5729 states to 5729 states and 10389 transitions. [2025-01-10 00:23:13,825 INFO L78 Accepts]: Start accepts. Automaton has 5729 states and 10389 transitions. Word has length 93 [2025-01-10 00:23:13,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:13,825 INFO L471 AbstractCegarLoop]: Abstraction has 5729 states and 10389 transitions. [2025-01-10 00:23:13,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.733333333333333) 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:23:13,826 INFO L276 IsEmpty]: Start isEmpty. Operand 5729 states and 10389 transitions. [2025-01-10 00:23:13,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-10 00:23:13,827 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:13,827 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:23:13,836 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:23:14,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 00:23:14,033 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:23:14,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:14,035 INFO L85 PathProgramCache]: Analyzing trace with hash -170304127, now seen corresponding path program 1 times [2025-01-10 00:23:14,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:14,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95852920] [2025-01-10 00:23:14,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:14,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:14,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 00:23:14,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 00:23:14,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:14,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:14,416 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:23:14,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:14,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95852920] [2025-01-10 00:23:14,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95852920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:14,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:14,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-10 00:23:14,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010444944] [2025-01-10 00:23:14,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:14,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:23:14,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:14,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:23:14,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:23:14,418 INFO L87 Difference]: Start difference. First operand 5729 states and 10389 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:23:18,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:18,873 INFO L93 Difference]: Finished difference Result 5748 states and 10414 transitions. [2025-01-10 00:23:18,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:23:18,874 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:23:18,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:18,883 INFO L225 Difference]: With dead ends: 5748 [2025-01-10 00:23:18,883 INFO L226 Difference]: Without dead ends: 5748 [2025-01-10 00:23:18,883 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:23:18,884 INFO L435 NwaCegarLoop]: 2616 mSDtfsCounter, 1906 mSDsluCounter, 12728 mSDsCounter, 0 mSdLazyCounter, 8406 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2410 SdHoareTripleChecker+Valid, 15344 SdHoareTripleChecker+Invalid, 8920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 8406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:18,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2410 Valid, 15344 Invalid, 8920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 8406 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-01-10 00:23:18,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5748 states. [2025-01-10 00:23:19,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5748 to 5744. [2025-01-10 00:23:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5744 states, 3451 states have (on average 1.8527962909301652) internal successors, (6394), 5732 states have internal predecessors, (6394), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2025-01-10 00:23:19,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5744 states to 5744 states and 10408 transitions. [2025-01-10 00:23:19,332 INFO L78 Accepts]: Start accepts. Automaton has 5744 states and 10408 transitions. Word has length 95 [2025-01-10 00:23:19,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:19,332 INFO L471 AbstractCegarLoop]: Abstraction has 5744 states and 10408 transitions. [2025-01-10 00:23:19,332 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:23:19,332 INFO L276 IsEmpty]: Start isEmpty. Operand 5744 states and 10408 transitions. [2025-01-10 00:23:19,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-10 00:23:19,333 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:19,333 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:23:19,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 00:23:19,333 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:23:19,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:19,335 INFO L85 PathProgramCache]: Analyzing trace with hash -170304126, now seen corresponding path program 1 times [2025-01-10 00:23:19,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:19,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598607843] [2025-01-10 00:23:19,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:19,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:19,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 00:23:19,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 00:23:19,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:19,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:19,780 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:23:19,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:19,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598607843] [2025-01-10 00:23:19,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598607843] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:19,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:19,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:23:19,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20992932] [2025-01-10 00:23:19,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:19,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:23:19,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:19,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:23:19,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:23:19,782 INFO L87 Difference]: Start difference. First operand 5744 states and 10408 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:23:26,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:26,197 INFO L93 Difference]: Finished difference Result 5747 states and 10412 transitions. [2025-01-10 00:23:26,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:23:26,197 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:23:26,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:26,207 INFO L225 Difference]: With dead ends: 5747 [2025-01-10 00:23:26,207 INFO L226 Difference]: Without dead ends: 5747 [2025-01-10 00:23:26,208 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:23:26,208 INFO L435 NwaCegarLoop]: 2620 mSDtfsCounter, 1881 mSDsluCounter, 15141 mSDsCounter, 0 mSdLazyCounter, 8908 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2385 SdHoareTripleChecker+Valid, 17761 SdHoareTripleChecker+Invalid, 9420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 8908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:26,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2385 Valid, 17761 Invalid, 9420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 8908 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2025-01-10 00:23:26,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5747 states. [2025-01-10 00:23:26,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5747 to 5744. [2025-01-10 00:23:26,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5744 states, 3451 states have (on average 1.8522167487684729) internal successors, (6392), 5732 states have internal predecessors, (6392), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2025-01-10 00:23:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5744 states to 5744 states and 10406 transitions. [2025-01-10 00:23:26,509 INFO L78 Accepts]: Start accepts. Automaton has 5744 states and 10406 transitions. Word has length 95 [2025-01-10 00:23:26,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:26,509 INFO L471 AbstractCegarLoop]: Abstraction has 5744 states and 10406 transitions. [2025-01-10 00:23:26,509 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:23:26,509 INFO L276 IsEmpty]: Start isEmpty. Operand 5744 states and 10406 transitions. [2025-01-10 00:23:26,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-10 00:23:26,510 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:26,510 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:23:26,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 00:23:26,510 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:23:26,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:26,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1984066953, now seen corresponding path program 1 times [2025-01-10 00:23:26,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:26,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854768941] [2025-01-10 00:23:26,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:26,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:26,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-10 00:23:26,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 00:23:26,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:26,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:27,006 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:23:27,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:27,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854768941] [2025-01-10 00:23:27,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854768941] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:27,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605709224] [2025-01-10 00:23:27,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:27,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:23:27,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:23:27,009 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:23:27,016 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:23:27,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-10 00:23:27,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 00:23:27,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:27,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:27,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 00:23:27,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:23:27,205 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:23:27,385 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:23:27,385 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:23:27,437 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:23:27,517 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:23:27,620 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:27,620 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:23:27,682 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:27,683 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:23:27,692 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:23:27,716 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:23:27,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:23:27,723 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1012 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1012) |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:23:27,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605709224] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:27,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:23:27,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-01-10 00:23:27,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562904878] [2025-01-10 00:23:27,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:23:27,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 00:23:27,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:27,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 00:23:27,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=450, Unknown=25, NotChecked=44, Total=600 [2025-01-10 00:23:27,797 INFO L87 Difference]: Start difference. First operand 5744 states and 10406 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:23:35,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:35,557 INFO L93 Difference]: Finished difference Result 5746 states and 10410 transitions. [2025-01-10 00:23:35,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:23:35,558 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:23:35,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:35,575 INFO L225 Difference]: With dead ends: 5746 [2025-01-10 00:23:35,575 INFO L226 Difference]: Without dead ends: 5746 [2025-01-10 00:23:35,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=575, Unknown=28, NotChecked=50, Total=756 [2025-01-10 00:23:35,576 INFO L435 NwaCegarLoop]: 2615 mSDtfsCounter, 1870 mSDsluCounter, 19096 mSDsCounter, 0 mSdLazyCounter, 13833 mSolverCounterSat, 516 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2374 SdHoareTripleChecker+Valid, 21711 SdHoareTripleChecker+Invalid, 14349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 13833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:35,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2374 Valid, 21711 Invalid, 14349 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [516 Valid, 13833 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2025-01-10 00:23:35,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5746 states. [2025-01-10 00:23:35,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5746 to 5743. [2025-01-10 00:23:35,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5743 states, 3451 states have (on average 1.8516372066067806) internal successors, (6390), 5731 states have internal predecessors, (6390), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 4 states have return successors, (2007), 11 states have call predecessors, (2007), 2005 states have call successors, (2007) [2025-01-10 00:23:35,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5743 states to 5743 states and 10404 transitions. [2025-01-10 00:23:35,891 INFO L78 Accepts]: Start accepts. Automaton has 5743 states and 10404 transitions. Word has length 96 [2025-01-10 00:23:35,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:35,891 INFO L471 AbstractCegarLoop]: Abstraction has 5743 states and 10404 transitions. [2025-01-10 00:23:35,891 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:23:35,891 INFO L276 IsEmpty]: Start isEmpty. Operand 5743 states and 10404 transitions. [2025-01-10 00:23:35,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-10 00:23:35,892 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:35,892 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:23:35,899 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:23:36,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:23:36,093 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:23:36,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:36,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1984066952, now seen corresponding path program 1 times [2025-01-10 00:23:36,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:36,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493190374] [2025-01-10 00:23:36,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:36,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:36,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-10 00:23:36,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 00:23:36,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:36,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:36,641 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:23:36,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:36,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493190374] [2025-01-10 00:23:36,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493190374] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:36,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570981032] [2025-01-10 00:23:36,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:36,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:23:36,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:23:36,648 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:23:36,658 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:23:36,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-10 00:23:36,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 00:23:36,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:36,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:36,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-10 00:23:36,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:23:36,839 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:23:36,921 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:23:36,928 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:23:36,928 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:23:36,951 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:23:36,955 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:23:37,017 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:23:37,021 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:23:37,098 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:37,099 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:23:37,104 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:23:37,162 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:37,163 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:23:37,169 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:23:37,183 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:23:37,186 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:23:37,202 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:23:37,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:23:37,253 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1168 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1167 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-01-10 00:23:37,262 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_1168 (Array Int Int)) (v_ArrVal_1167 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1168 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-01-10 00:23:37,306 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1174))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1173) .cse0 v_ArrVal_1168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1173) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2025-01-10 00:23:37,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570981032] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:37,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:23:37,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-01-10 00:23:37,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056912182] [2025-01-10 00:23:37,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:23:37,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 00:23:37,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:37,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 00:23:37,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=398, Unknown=3, NotChecked=126, Total=600 [2025-01-10 00:23:37,309 INFO L87 Difference]: Start difference. First operand 5743 states and 10404 transitions. Second operand has 20 states, 17 states have (on average 8.941176470588236) internal successors, (152), 20 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:23:50,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:50,362 INFO L93 Difference]: Finished difference Result 5745 states and 10408 transitions. [2025-01-10 00:23:50,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:23:50,363 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.941176470588236) internal successors, (152), 20 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:23:50,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:50,377 INFO L225 Difference]: With dead ends: 5745 [2025-01-10 00:23:50,377 INFO L226 Difference]: Without dead ends: 5745 [2025-01-10 00:23:50,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=595, Unknown=3, NotChecked=156, Total=870 [2025-01-10 00:23:50,378 INFO L435 NwaCegarLoop]: 2618 mSDtfsCounter, 1875 mSDsluCounter, 19081 mSDsCounter, 0 mSdLazyCounter, 11389 mSolverCounterSat, 1022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2379 SdHoareTripleChecker+Valid, 21699 SdHoareTripleChecker+Invalid, 12411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1022 IncrementalHoareTripleChecker+Valid, 11389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:50,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2379 Valid, 21699 Invalid, 12411 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1022 Valid, 11389 Invalid, 0 Unknown, 0 Unchecked, 12.7s Time] [2025-01-10 00:23:50,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5745 states. [2025-01-10 00:23:50,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5745 to 5727. [2025-01-10 00:23:50,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5727 states, 3437 states have (on average 1.8542333430317137) internal successors, (6373), 5717 states have internal predecessors, (6373), 2007 states have call successors, (2007), 4 states have call predecessors, (2007), 3 states have return successors, (2005), 9 states have call predecessors, (2005), 2005 states have call successors, (2005) [2025-01-10 00:23:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5727 states to 5727 states and 10385 transitions. [2025-01-10 00:23:50,687 INFO L78 Accepts]: Start accepts. Automaton has 5727 states and 10385 transitions. Word has length 96 [2025-01-10 00:23:50,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:50,687 INFO L471 AbstractCegarLoop]: Abstraction has 5727 states and 10385 transitions. [2025-01-10 00:23:50,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.941176470588236) internal successors, (152), 20 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:23:50,687 INFO L276 IsEmpty]: Start isEmpty. Operand 5727 states and 10385 transitions. [2025-01-10 00:23:50,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-10 00:23:50,688 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:50,688 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:23:50,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 00:23:50,892 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,SelfDestructingSolverStorable20 [2025-01-10 00:23:50,893 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:23:50,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:50,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1173224403, now seen corresponding path program 1 times [2025-01-10 00:23:50,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:50,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197145879] [2025-01-10 00:23:50,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:50,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:50,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 00:23:50,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 00:23:50,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:50,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:51,319 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:23:51,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:51,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197145879] [2025-01-10 00:23:51,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197145879] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:51,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:51,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-10 00:23:51,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10721448] [2025-01-10 00:23:51,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:51,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 00:23:51,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:51,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 00:23:51,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-01-10 00:23:51,321 INFO L87 Difference]: Start difference. First operand 5727 states and 10385 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)