./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a17e1f9edfd37607fb472869452b377d4af1281c9808dec0371b4f943952037 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:29:10,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:29:10,227 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:29:10,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:29:10,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:29:10,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:29:10,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:29:10,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:29:10,253 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:29:10,253 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:29:10,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:29:10,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:29:10,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:29:10,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:29:10,254 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:29:10,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:29:10,254 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:29:10,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:29:10,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:29:10,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:29:10,254 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:29:10,255 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:29:10,255 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:29:10,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:29:10,255 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:29:10,255 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:29:10,255 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:29:10,255 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:29:10,255 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:29:10,256 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:29:10,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:29:10,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:29:10,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:29:10,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:29:10,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:29:10,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:29:10,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:29:10,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:29:10,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:29:10,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:29:10,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:29:10,257 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:29:10,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:29:10,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:29:10,258 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:29:10,258 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:29:10,258 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:29:10,258 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 -> 1a17e1f9edfd37607fb472869452b377d4af1281c9808dec0371b4f943952037 [2025-01-10 00:29:10,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:29:10,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:29:10,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:29:10,568 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:29:10,568 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:29:10,569 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_SAX_test5-1.i [2025-01-10 00:29:11,889 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/167ab5a1a/c3621feefa5641aa992b94989edc11fc/FLAG9290a7811 [2025-01-10 00:29:12,249 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:29:12,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i [2025-01-10 00:29:12,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/167ab5a1a/c3621feefa5641aa992b94989edc11fc/FLAG9290a7811 [2025-01-10 00:29:12,467 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/167ab5a1a/c3621feefa5641aa992b94989edc11fc [2025-01-10 00:29:12,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:29:12,470 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:29:12,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:29:12,472 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:29:12,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:29:12,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:29:12" (1/1) ... [2025-01-10 00:29:12,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ce29dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:29:12, skipping insertion in model container [2025-01-10 00:29:12,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:29:12" (1/1) ... [2025-01-10 00:29:12,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:29:12,898 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:29:12,928 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:29:12,931 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:29:12,934 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:29:12,946 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:29:12,971 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:29:12,973 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:29:12,975 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:29:12,979 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:29:13,010 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:29:13,010 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:29:13,017 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:29:13,017 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:29:13,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:29:13,044 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:29:13,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:29:13,240 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:29:13,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:29:13 WrapperNode [2025-01-10 00:29:13,241 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:29:13,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:29:13,241 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:29:13,242 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:29:13,246 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:29:13" (1/1) ... [2025-01-10 00:29:13,270 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:29:13" (1/1) ... [2025-01-10 00:29:13,355 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1990 [2025-01-10 00:29:13,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:29:13,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:29:13,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:29:13,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:29:13,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:29:13" (1/1) ... [2025-01-10 00:29:13,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:29:13" (1/1) ... [2025-01-10 00:29:13,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:29:13" (1/1) ... [2025-01-10 00:29:13,479 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 323, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 82, 1]. [2025-01-10 00:29:13,483 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:29:13" (1/1) ... [2025-01-10 00:29:13,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:29:13" (1/1) ... [2025-01-10 00:29:13,570 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:29:13" (1/1) ... [2025-01-10 00:29:13,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:29:13" (1/1) ... [2025-01-10 00:29:13,594 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:29:13" (1/1) ... [2025-01-10 00:29:13,604 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:29:13" (1/1) ... [2025-01-10 00:29:13,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:29:13" (1/1) ... [2025-01-10 00:29:13,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:29:13,640 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:29:13,640 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:29:13,640 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:29:13,642 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:29:13" (1/1) ... [2025-01-10 00:29:13,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:29:13,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:29:13,673 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:29:13,677 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:29:13,702 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-01-10 00:29:13,702 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-01-10 00:29:13,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:29:13,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:29:13,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:29:13,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 00:29:13,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 00:29:13,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:29:13,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:29:13,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:29:13,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 00:29:13,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 00:29:13,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-10 00:29:13,703 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 00:29:13,703 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 00:29:13,703 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-10 00:29:13,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:29:13,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:29:13,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:29:13,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:29:13,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 00:29:13,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:29:13,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:29:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:29:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 00:29:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:29:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:29:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:29:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:29:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:29:13,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:29:13,940 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:29:13,941 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:29:13,961 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:29:13,990 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:29:14,008 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:29:16,683 INFO L? ?]: Removed 1734 outVars from TransFormulas that were not future-live. [2025-01-10 00:29:16,684 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:29:16,742 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:29:16,742 INFO L312 CfgBuilder]: Removed 39 assume(true) statements. [2025-01-10 00:29:16,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:29:16 BoogieIcfgContainer [2025-01-10 00:29:16,743 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:29:16,746 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:29:16,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:29:16,750 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:29:16,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:29:12" (1/3) ... [2025-01-10 00:29:16,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc5fb85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:29:16, skipping insertion in model container [2025-01-10 00:29:16,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:29:13" (2/3) ... [2025-01-10 00:29:16,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc5fb85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:29:16, skipping insertion in model container [2025-01-10 00:29:16,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:29:16" (3/3) ... [2025-01-10 00:29:16,753 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test5-1.i [2025-01-10 00:29:16,767 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:29:16,768 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test5-1.i that has 6 procedures, 1741 locations, 1 initial locations, 49 loop locations, and 712 error locations. [2025-01-10 00:29:16,850 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:29:16,862 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;@2c580c1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:29:16,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 712 error locations. [2025-01-10 00:29:16,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 1731 states, 1008 states have (on average 2.0337301587301586) internal successors, (2050), 1721 states have internal predecessors, (2050), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 00:29:16,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 00:29:16,878 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:29:16,878 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:29:16,878 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr710ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:29:16,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:29:16,884 INFO L85 PathProgramCache]: Analyzing trace with hash 65531891, now seen corresponding path program 1 times [2025-01-10 00:29:16,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:29:16,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53828944] [2025-01-10 00:29:16,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:29:16,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:29:16,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:29:16,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:29:16,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:29:16,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:29:17,075 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:29:17,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:29:17,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53828944] [2025-01-10 00:29:17,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53828944] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:29:17,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:29:17,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:29:17,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960487662] [2025-01-10 00:29:17,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:29:17,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:29:17,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:29:17,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:29:17,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:29:17,110 INFO L87 Difference]: Start difference. First operand has 1731 states, 1008 states have (on average 2.0337301587301586) internal successors, (2050), 1721 states have internal predecessors, (2050), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:29:17,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:29:17,316 INFO L93 Difference]: Finished difference Result 3403 states and 3923 transitions. [2025-01-10 00:29:17,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:29:17,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 00:29:17,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:29:17,345 INFO L225 Difference]: With dead ends: 3403 [2025-01-10 00:29:17,345 INFO L226 Difference]: Without dead ends: 3401 [2025-01-10 00:29:17,347 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:29:17,350 INFO L435 NwaCegarLoop]: 1969 mSDtfsCounter, 1927 mSDsluCounter, 1960 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1938 SdHoareTripleChecker+Valid, 3929 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:29:17,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1938 Valid, 3929 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:29:17,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3401 states. [2025-01-10 00:29:17,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3401 to 1711. [2025-01-10 00:29:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1000 states have (on average 1.947) internal successors, (1947), 1701 states have internal predecessors, (1947), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:29:17,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 1971 transitions. [2025-01-10 00:29:17,512 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 1971 transitions. Word has length 5 [2025-01-10 00:29:17,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:29:17,512 INFO L471 AbstractCegarLoop]: Abstraction has 1711 states and 1971 transitions. [2025-01-10 00:29:17,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:29:17,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 1971 transitions. [2025-01-10 00:29:17,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 00:29:17,513 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:29:17,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:29:17,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:29:17,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:29:17,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:29:17,515 INFO L85 PathProgramCache]: Analyzing trace with hash 63049834, now seen corresponding path program 1 times [2025-01-10 00:29:17,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:29:17,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469848985] [2025-01-10 00:29:17,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:29:17,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:29:17,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:29:17,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:29:17,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:29:17,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:29:17,607 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:29:17,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:29:17,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469848985] [2025-01-10 00:29:17,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469848985] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:29:17,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:29:17,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:29:17,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910522125] [2025-01-10 00:29:17,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:29:17,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:29:17,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:29:17,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:29:17,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:29:17,609 INFO L87 Difference]: Start difference. First operand 1711 states and 1971 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:29:18,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:29:18,610 INFO L93 Difference]: Finished difference Result 1619 states and 1879 transitions. [2025-01-10 00:29:18,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:29:18,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 00:29:18,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:29:18,618 INFO L225 Difference]: With dead ends: 1619 [2025-01-10 00:29:18,618 INFO L226 Difference]: Without dead ends: 1619 [2025-01-10 00:29:18,618 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:29:18,619 INFO L435 NwaCegarLoop]: 1177 mSDtfsCounter, 1730 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1741 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:29:18,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1741 Valid, 1188 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-10 00:29:18,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2025-01-10 00:29:18,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1619. [2025-01-10 00:29:18,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1619 states, 1000 states have (on average 1.855) internal successors, (1855), 1609 states have internal predecessors, (1855), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:29:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 1879 transitions. [2025-01-10 00:29:18,681 INFO L78 Accepts]: Start accepts. Automaton has 1619 states and 1879 transitions. Word has length 5 [2025-01-10 00:29:18,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:29:18,681 INFO L471 AbstractCegarLoop]: Abstraction has 1619 states and 1879 transitions. [2025-01-10 00:29:18,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:29:18,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 1879 transitions. [2025-01-10 00:29:18,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 00:29:18,682 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:29:18,682 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:29:18,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:29:18,683 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:29:18,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:29:18,684 INFO L85 PathProgramCache]: Analyzing trace with hash 63049835, now seen corresponding path program 1 times [2025-01-10 00:29:18,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:29:18,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780025832] [2025-01-10 00:29:18,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:29:18,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:29:18,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:29:18,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:29:18,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:29:18,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:29:18,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:29:18,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:29:18,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780025832] [2025-01-10 00:29:18,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780025832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:29:18,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:29:18,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:29:18,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285126487] [2025-01-10 00:29:18,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:29:18,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:29:18,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:29:18,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:29:18,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:29:18,778 INFO L87 Difference]: Start difference. First operand 1619 states and 1879 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:29:19,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:29:19,960 INFO L93 Difference]: Finished difference Result 2353 states and 2777 transitions. [2025-01-10 00:29:19,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:29:19,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 00:29:19,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:29:19,969 INFO L225 Difference]: With dead ends: 2353 [2025-01-10 00:29:19,970 INFO L226 Difference]: Without dead ends: 2353 [2025-01-10 00:29:19,970 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:29:19,971 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 1212 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:29:19,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 2463 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-10 00:29:19,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2025-01-10 00:29:20,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1881. [2025-01-10 00:29:20,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1881 states, 1272 states have (on average 1.830188679245283) internal successors, (2328), 1871 states have internal predecessors, (2328), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:29:20,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 2352 transitions. [2025-01-10 00:29:20,016 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 2352 transitions. Word has length 5 [2025-01-10 00:29:20,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:29:20,016 INFO L471 AbstractCegarLoop]: Abstraction has 1881 states and 2352 transitions. [2025-01-10 00:29:20,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:29:20,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2352 transitions. [2025-01-10 00:29:20,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 00:29:20,017 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:29:20,017 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:29:20,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:29:20,017 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:29:20,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:29:20,019 INFO L85 PathProgramCache]: Analyzing trace with hash 477027540, now seen corresponding path program 1 times [2025-01-10 00:29:20,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:29:20,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787191551] [2025-01-10 00:29:20,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:29:20,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:29:20,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:29:20,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:29:20,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:29:20,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:29:20,120 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:29:20,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:29:20,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787191551] [2025-01-10 00:29:20,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787191551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:29:20,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:29:20,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:29:20,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41720110] [2025-01-10 00:29:20,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:29:20,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:29:20,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:29:20,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:29:20,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:29:20,126 INFO L87 Difference]: Start difference. First operand 1881 states and 2352 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:29:21,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:29:21,272 INFO L93 Difference]: Finished difference Result 1907 states and 2405 transitions. [2025-01-10 00:29:21,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:29:21,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-10 00:29:21,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:29:21,280 INFO L225 Difference]: With dead ends: 1907 [2025-01-10 00:29:21,280 INFO L226 Difference]: Without dead ends: 1907 [2025-01-10 00:29:21,280 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:29:21,282 INFO L435 NwaCegarLoop]: 1153 mSDtfsCounter, 1997 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2008 SdHoareTripleChecker+Valid, 2163 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:29:21,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2008 Valid, 2163 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-10 00:29:21,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2025-01-10 00:29:21,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1858. [2025-01-10 00:29:21,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1272 states have (on average 1.8121069182389937) internal successors, (2305), 1848 states have internal predecessors, (2305), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:29:21,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2329 transitions. [2025-01-10 00:29:21,316 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2329 transitions. Word has length 11 [2025-01-10 00:29:21,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:29:21,317 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2329 transitions. [2025-01-10 00:29:21,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:29:21,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2329 transitions. [2025-01-10 00:29:21,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 00:29:21,317 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:29:21,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:29:21,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:29:21,318 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:29:21,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:29:21,319 INFO L85 PathProgramCache]: Analyzing trace with hash 477027541, now seen corresponding path program 1 times [2025-01-10 00:29:21,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:29:21,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769989748] [2025-01-10 00:29:21,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:29:21,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:29:21,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:29:21,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:29:21,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:29:21,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:29:21,418 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:29:21,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:29:21,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769989748] [2025-01-10 00:29:21,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769989748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:29:21,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:29:21,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:29:21,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100272242] [2025-01-10 00:29:21,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:29:21,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:29:21,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:29:21,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:29:21,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:29:21,420 INFO L87 Difference]: Start difference. First operand 1858 states and 2329 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:29:21,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:29:21,453 INFO L93 Difference]: Finished difference Result 1783 states and 2226 transitions. [2025-01-10 00:29:21,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:29:21,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-10 00:29:21,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:29:21,460 INFO L225 Difference]: With dead ends: 1783 [2025-01-10 00:29:21,460 INFO L226 Difference]: Without dead ends: 1783 [2025-01-10 00:29:21,461 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:29:21,462 INFO L435 NwaCegarLoop]: 1730 mSDtfsCounter, 60 mSDsluCounter, 1677 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 3407 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:29:21,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 3407 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:29:21,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2025-01-10 00:29:21,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1783. [2025-01-10 00:29:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1209 states have (on average 1.8213399503722085) internal successors, (2202), 1773 states have internal predecessors, (2202), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:29:21,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2226 transitions. [2025-01-10 00:29:21,500 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2226 transitions. Word has length 11 [2025-01-10 00:29:21,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:29:21,501 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2226 transitions. [2025-01-10 00:29:21,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:29:21,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2226 transitions. [2025-01-10 00:29:21,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 00:29:21,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:29:21,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:29:21,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:29:21,502 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:29:21,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:29:21,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1903167439, now seen corresponding path program 1 times [2025-01-10 00:29:21,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:29:21,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853688155] [2025-01-10 00:29:21,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:29:21,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:29:21,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:29:21,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:29:21,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:29:21,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:29:21,600 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:29:21,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:29:21,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853688155] [2025-01-10 00:29:21,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853688155] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:29:21,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:29:21,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:29:21,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322485876] [2025-01-10 00:29:21,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:29:21,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:29:21,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:29:21,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:29:21,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:29:21,602 INFO L87 Difference]: Start difference. First operand 1783 states and 2226 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:29:21,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:29:21,678 INFO L93 Difference]: Finished difference Result 1765 states and 2201 transitions. [2025-01-10 00:29:21,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:29:21,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-10 00:29:21,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:29:21,684 INFO L225 Difference]: With dead ends: 1765 [2025-01-10 00:29:21,685 INFO L226 Difference]: Without dead ends: 1765 [2025-01-10 00:29:21,685 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:29:21,686 INFO L435 NwaCegarLoop]: 1695 mSDtfsCounter, 41 mSDsluCounter, 3362 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 5057 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:29:21,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 5057 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:29:21,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2025-01-10 00:29:21,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1762. [2025-01-10 00:29:21,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1762 states, 1195 states have (on average 1.8192468619246862) internal successors, (2174), 1752 states have internal predecessors, (2174), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:29:21,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 2198 transitions. [2025-01-10 00:29:21,720 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 2198 transitions. Word has length 12 [2025-01-10 00:29:21,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:29:21,720 INFO L471 AbstractCegarLoop]: Abstraction has 1762 states and 2198 transitions. [2025-01-10 00:29:21,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:29:21,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2198 transitions. [2025-01-10 00:29:21,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 00:29:21,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:29:21,723 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:29:21,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:29:21,723 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:29:21,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:29:21,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1855964541, now seen corresponding path program 1 times [2025-01-10 00:29:21,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:29:21,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645403545] [2025-01-10 00:29:21,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:29:21,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:29:21,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:29:21,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:29:21,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:29:21,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:29:21,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:29:21,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:29:21,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645403545] [2025-01-10 00:29:21,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645403545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:29:21,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:29:21,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:29:21,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146965119] [2025-01-10 00:29:21,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:29:21,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:29:21,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:29:21,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:29:21,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:29:21,957 INFO L87 Difference]: Start difference. First operand 1762 states and 2198 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:29:23,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:29:23,195 INFO L93 Difference]: Finished difference Result 2279 states and 2695 transitions. [2025-01-10 00:29:23,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:29:23,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-10 00:29:23,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:29:23,203 INFO L225 Difference]: With dead ends: 2279 [2025-01-10 00:29:23,203 INFO L226 Difference]: Without dead ends: 2279 [2025-01-10 00:29:23,204 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:29:23,204 INFO L435 NwaCegarLoop]: 1424 mSDtfsCounter, 1217 mSDsluCounter, 1942 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 3366 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:29:23,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 3366 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-10 00:29:23,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2025-01-10 00:29:23,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 1758. [2025-01-10 00:29:23,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1758 states, 1195 states have (on average 1.8158995815899581) internal successors, (2170), 1748 states have internal predecessors, (2170), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:29:23,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 2194 transitions. [2025-01-10 00:29:23,237 INFO L78 Accepts]: Start accepts. Automaton has 1758 states and 2194 transitions. Word has length 26 [2025-01-10 00:29:23,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:29:23,238 INFO L471 AbstractCegarLoop]: Abstraction has 1758 states and 2194 transitions. [2025-01-10 00:29:23,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:29:23,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 2194 transitions. [2025-01-10 00:29:23,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-10 00:29:23,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:29:23,239 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:29:23,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:29:23,240 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:29:23,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:29:23,240 INFO L85 PathProgramCache]: Analyzing trace with hash -754980717, now seen corresponding path program 1 times [2025-01-10 00:29:23,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:29:23,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618966597] [2025-01-10 00:29:23,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:29:23,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:29:23,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 00:29:23,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 00:29:23,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:29:23,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:29:23,353 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:29:23,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:29:23,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618966597] [2025-01-10 00:29:23,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618966597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:29:23,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:29:23,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:29:23,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82630501] [2025-01-10 00:29:23,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:29:23,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:29:23,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:29:23,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:29:23,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:29:23,356 INFO L87 Difference]: Start difference. First operand 1758 states and 2194 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:29:23,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:29:23,410 INFO L93 Difference]: Finished difference Result 1758 states and 2190 transitions. [2025-01-10 00:29:23,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:29:23,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-01-10 00:29:23,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:29:23,417 INFO L225 Difference]: With dead ends: 1758 [2025-01-10 00:29:23,418 INFO L226 Difference]: Without dead ends: 1758 [2025-01-10 00:29:23,418 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:29:23,418 INFO L435 NwaCegarLoop]: 1690 mSDtfsCounter, 21 mSDsluCounter, 3349 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5039 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:29:23,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5039 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:29:23,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2025-01-10 00:29:23,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1758. [2025-01-10 00:29:23,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1758 states, 1195 states have (on average 1.81255230125523) internal successors, (2166), 1748 states have internal predecessors, (2166), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:29:23,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 2190 transitions. [2025-01-10 00:29:23,453 INFO L78 Accepts]: Start accepts. Automaton has 1758 states and 2190 transitions. Word has length 60 [2025-01-10 00:29:23,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:29:23,454 INFO L471 AbstractCegarLoop]: Abstraction has 1758 states and 2190 transitions. [2025-01-10 00:29:23,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:29:23,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 2190 transitions. [2025-01-10 00:29:23,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-10 00:29:23,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:29:23,455 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:29:23,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:29:23,455 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:29:23,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:29:23,458 INFO L85 PathProgramCache]: Analyzing trace with hash -428091937, now seen corresponding path program 1 times [2025-01-10 00:29:23,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:29:23,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456162339] [2025-01-10 00:29:23,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:29:23,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:29:23,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 00:29:23,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 00:29:23,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:29:23,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:29:23,626 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:29:23,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:29:23,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456162339] [2025-01-10 00:29:23,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456162339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:29:23,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:29:23,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:29:23,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957886486] [2025-01-10 00:29:23,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:29:23,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:29:23,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:29:23,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:29:23,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:29:23,629 INFO L87 Difference]: Start difference. First operand 1758 states and 2190 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:29:23,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:29:23,674 INFO L93 Difference]: Finished difference Result 1849 states and 2308 transitions. [2025-01-10 00:29:23,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:29:23,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-10 00:29:23,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:29:23,682 INFO L225 Difference]: With dead ends: 1849 [2025-01-10 00:29:23,682 INFO L226 Difference]: Without dead ends: 1849 [2025-01-10 00:29:23,683 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:29:23,684 INFO L435 NwaCegarLoop]: 1704 mSDtfsCounter, 54 mSDsluCounter, 1677 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 3381 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:29:23,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 3381 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:29:23,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2025-01-10 00:29:23,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1849. [2025-01-10 00:29:23,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1849 states, 1286 states have (on average 1.776049766718507) internal successors, (2284), 1839 states have internal predecessors, (2284), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:29:23,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2308 transitions. [2025-01-10 00:29:23,712 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2308 transitions. Word has length 68 [2025-01-10 00:29:23,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:29:23,713 INFO L471 AbstractCegarLoop]: Abstraction has 1849 states and 2308 transitions. [2025-01-10 00:29:23,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:29:23,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2308 transitions. [2025-01-10 00:29:23,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-10 00:29:23,715 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:29:23,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:29:23,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:29:23,716 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:29:23,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:29:23,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1638039152, now seen corresponding path program 1 times [2025-01-10 00:29:23,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:29:23,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137339630] [2025-01-10 00:29:23,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:29:23,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:29:23,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-10 00:29:23,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 00:29:23,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:29:23,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:29:24,278 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:29:24,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:29:24,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137339630] [2025-01-10 00:29:24,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137339630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:29:24,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:29:24,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:29:24,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243615556] [2025-01-10 00:29:24,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:29:24,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:29:24,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:29:24,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:29:24,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:29:24,282 INFO L87 Difference]: Start difference. First operand 1849 states and 2308 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:29:25,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:29:25,772 INFO L93 Difference]: Finished difference Result 1765 states and 2224 transitions. [2025-01-10 00:29:25,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:29:25,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-01-10 00:29:25,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:29:25,777 INFO L225 Difference]: With dead ends: 1765 [2025-01-10 00:29:25,777 INFO L226 Difference]: Without dead ends: 1765 [2025-01-10 00:29:25,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:29:25,778 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 3033 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 2462 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3044 SdHoareTripleChecker+Valid, 2350 SdHoareTripleChecker+Invalid, 2571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:29:25,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3044 Valid, 2350 Invalid, 2571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2462 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-10 00:29:25,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2025-01-10 00:29:25,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1493. [2025-01-10 00:29:25,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 1014 states have (on average 1.693293885601578) internal successors, (1717), 1483 states have internal predecessors, (1717), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:29:25,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1741 transitions. [2025-01-10 00:29:25,799 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1741 transitions. Word has length 71 [2025-01-10 00:29:25,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:29:25,799 INFO L471 AbstractCegarLoop]: Abstraction has 1493 states and 1741 transitions. [2025-01-10 00:29:25,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:29:25,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1741 transitions. [2025-01-10 00:29:25,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-10 00:29:25,800 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:29:25,801 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:29:25,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:29:25,801 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:29:25,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:29:25,801 INFO L85 PathProgramCache]: Analyzing trace with hash 184750066, now seen corresponding path program 1 times [2025-01-10 00:29:25,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:29:25,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351186064] [2025-01-10 00:29:25,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:29:25,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:29:25,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-10 00:29:25,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-10 00:29:25,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:29:25,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:29:26,104 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:29:26,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:29:26,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351186064] [2025-01-10 00:29:26,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351186064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:29:26,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:29:26,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:29:26,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588293366] [2025-01-10 00:29:26,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:29:26,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:29:26,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:29:26,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:29:26,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:29:26,105 INFO L87 Difference]: Start difference. First operand 1493 states and 1741 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:29:26,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:29:26,982 INFO L93 Difference]: Finished difference Result 1492 states and 1740 transitions. [2025-01-10 00:29:26,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:29:26,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-10 00:29:26,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:29:26,986 INFO L225 Difference]: With dead ends: 1492 [2025-01-10 00:29:26,986 INFO L226 Difference]: Without dead ends: 1492 [2025-01-10 00:29:26,986 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:29:26,987 INFO L435 NwaCegarLoop]: 1616 mSDtfsCounter, 2 mSDsluCounter, 3134 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4750 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:29:26,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4750 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 00:29:26,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2025-01-10 00:29:27,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1492. [2025-01-10 00:29:27,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1014 states have (on average 1.6923076923076923) internal successors, (1716), 1482 states have internal predecessors, (1716), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:29:27,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1740 transitions. [2025-01-10 00:29:27,007 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1740 transitions. Word has length 76 [2025-01-10 00:29:27,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:29:27,008 INFO L471 AbstractCegarLoop]: Abstraction has 1492 states and 1740 transitions. [2025-01-10 00:29:27,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:29:27,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1740 transitions. [2025-01-10 00:29:27,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-10 00:29:27,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:29:27,013 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:29:27,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:29:27,013 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:29:27,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:29:27,013 INFO L85 PathProgramCache]: Analyzing trace with hash 184750067, now seen corresponding path program 1 times [2025-01-10 00:29:27,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:29:27,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091686693] [2025-01-10 00:29:27,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:29:27,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:29:27,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-10 00:29:27,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-10 00:29:27,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:29:27,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:29:27,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:29:27,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:29:27,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091686693] [2025-01-10 00:29:27,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091686693] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:29:27,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:29:27,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:29:27,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740705415] [2025-01-10 00:29:27,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:29:27,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:29:27,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:29:27,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:29:27,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:29:27,487 INFO L87 Difference]: Start difference. First operand 1492 states and 1740 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:29:28,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:29:28,509 INFO L93 Difference]: Finished difference Result 1491 states and 1739 transitions. [2025-01-10 00:29:28,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:29:28,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-10 00:29:28,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:29:28,513 INFO L225 Difference]: With dead ends: 1491 [2025-01-10 00:29:28,513 INFO L226 Difference]: Without dead ends: 1491 [2025-01-10 00:29:28,513 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:29:28,513 INFO L435 NwaCegarLoop]: 1616 mSDtfsCounter, 1 mSDsluCounter, 3156 mSDsCounter, 0 mSdLazyCounter, 1696 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4772 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:29:28,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4772 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1696 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-10 00:29:28,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2025-01-10 00:29:28,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1491. [2025-01-10 00:29:28,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1491 states, 1013 states have (on average 1.6929911154985193) internal successors, (1715), 1481 states have internal predecessors, (1715), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:29:28,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 1739 transitions. [2025-01-10 00:29:28,531 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 1739 transitions. Word has length 76 [2025-01-10 00:29:28,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:29:28,531 INFO L471 AbstractCegarLoop]: Abstraction has 1491 states and 1739 transitions. [2025-01-10 00:29:28,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:29:28,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1739 transitions. [2025-01-10 00:29:28,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-10 00:29:28,532 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:29:28,532 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:29:28,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:29:28,533 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:29:28,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:29:28,533 INFO L85 PathProgramCache]: Analyzing trace with hash 55751129, now seen corresponding path program 1 times [2025-01-10 00:29:28,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:29:28,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073218271] [2025-01-10 00:29:28,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:29:28,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:29:28,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-10 00:29:28,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 00:29:28,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:29:28,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:29:28,760 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:29:28,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:29:28,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073218271] [2025-01-10 00:29:28,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073218271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:29:28,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:29:28,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:29:28,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036037149] [2025-01-10 00:29:28,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:29:28,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:29:28,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:29:28,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:29:28,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:29:28,763 INFO L87 Difference]: Start difference. First operand 1491 states and 1739 transitions. Second operand has 7 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:29:30,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:29:30,067 INFO L93 Difference]: Finished difference Result 1503 states and 1757 transitions. [2025-01-10 00:29:30,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:29:30,067 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2025-01-10 00:29:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:29:30,077 INFO L225 Difference]: With dead ends: 1503 [2025-01-10 00:29:30,078 INFO L226 Difference]: Without dead ends: 1503 [2025-01-10 00:29:30,078 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:29:30,079 INFO L435 NwaCegarLoop]: 1598 mSDtfsCounter, 13 mSDsluCounter, 5830 mSDsCounter, 0 mSdLazyCounter, 2262 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 7428 SdHoareTripleChecker+Invalid, 2275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:29:30,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 7428 Invalid, 2275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2262 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-10 00:29:30,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2025-01-10 00:29:30,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1497. [2025-01-10 00:29:30,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1018 states have (on average 1.6915520628683693) internal successors, (1722), 1486 states have internal predecessors, (1722), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2025-01-10 00:29:30,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 1752 transitions. [2025-01-10 00:29:30,104 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 1752 transitions. Word has length 84 [2025-01-10 00:29:30,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:29:30,104 INFO L471 AbstractCegarLoop]: Abstraction has 1497 states and 1752 transitions. [2025-01-10 00:29:30,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:29:30,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1752 transitions. [2025-01-10 00:29:30,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-10 00:29:30,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:29:30,106 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:29:30,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:29:30,106 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:29:30,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:29:30,106 INFO L85 PathProgramCache]: Analyzing trace with hash 55751130, now seen corresponding path program 1 times [2025-01-10 00:29:30,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:29:30,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562728363] [2025-01-10 00:29:30,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:29:30,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:29:30,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-10 00:29:30,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 00:29:30,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:29:30,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:29:30,586 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:29:30,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:29:30,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562728363] [2025-01-10 00:29:30,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562728363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:29:30,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:29:30,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:29:30,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640395622] [2025-01-10 00:29:30,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:29:30,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:29:30,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:29:30,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:29:30,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:29:30,588 INFO L87 Difference]: Start difference. First operand 1497 states and 1752 transitions. Second operand has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:29:31,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:29:31,952 INFO L93 Difference]: Finished difference Result 1497 states and 1751 transitions. [2025-01-10 00:29:31,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:29:31,953 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2025-01-10 00:29:31,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:29:31,960 INFO L225 Difference]: With dead ends: 1497 [2025-01-10 00:29:31,960 INFO L226 Difference]: Without dead ends: 1497 [2025-01-10 00:29:31,961 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:29:31,961 INFO L435 NwaCegarLoop]: 1605 mSDtfsCounter, 8 mSDsluCounter, 4494 mSDsCounter, 0 mSdLazyCounter, 1969 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6099 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:29:31,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6099 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1969 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-10 00:29:31,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2025-01-10 00:29:31,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1497. [2025-01-10 00:29:31,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1018 states have (on average 1.6905697445972494) internal successors, (1721), 1486 states have internal predecessors, (1721), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2025-01-10 00:29:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 1751 transitions. [2025-01-10 00:29:31,983 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 1751 transitions. Word has length 84 [2025-01-10 00:29:31,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:29:31,983 INFO L471 AbstractCegarLoop]: Abstraction has 1497 states and 1751 transitions. [2025-01-10 00:29:31,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:29:31,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1751 transitions. [2025-01-10 00:29:31,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-10 00:29:31,986 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:29:31,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:29:31,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:29:31,986 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:29:31,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:29:31,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1240902629, now seen corresponding path program 1 times [2025-01-10 00:29:31,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:29:31,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025257608] [2025-01-10 00:29:31,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:29:31,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:29:32,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 00:29:32,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 00:29:32,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:29:32,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:29:32,472 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:29:32,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:29:32,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025257608] [2025-01-10 00:29:32,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025257608] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:29:32,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214624041] [2025-01-10 00:29:32,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:29:32,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:29:32,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:29:32,476 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:29:32,478 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:29:32,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 00:29:32,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 00:29:32,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:29:32,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:29:32,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 00:29:32,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:29:32,757 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:29:32,889 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:29:32,889 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:29:32,905 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:29:32,992 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:29:32,992 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:29:33,026 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:29:33,029 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:29:33,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:29:33,088 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-01-10 00:29:33,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2025-01-10 00:29:33,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214624041] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:29:33,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:29:33,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2025-01-10 00:29:33,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676191707] [2025-01-10 00:29:33,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:29:33,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:29:33,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:29:33,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:29:33,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=171, Unknown=4, NotChecked=0, Total=210 [2025-01-10 00:29:33,140 INFO L87 Difference]: Start difference. First operand 1497 states and 1751 transitions. Second operand has 14 states, 12 states have (on average 10.083333333333334) internal successors, (121), 13 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 00:29:35,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:29:35,713 INFO L93 Difference]: Finished difference Result 1496 states and 1750 transitions. [2025-01-10 00:29:35,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:29:35,714 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.083333333333334) internal successors, (121), 13 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 85 [2025-01-10 00:29:35,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:29:35,719 INFO L225 Difference]: With dead ends: 1496 [2025-01-10 00:29:35,720 INFO L226 Difference]: Without dead ends: 1496 [2025-01-10 00:29:35,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=374, Unknown=4, NotChecked=0, Total=462 [2025-01-10 00:29:35,720 INFO L435 NwaCegarLoop]: 1038 mSDtfsCounter, 1533 mSDsluCounter, 9135 mSDsCounter, 0 mSdLazyCounter, 5968 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 10173 SdHoareTripleChecker+Invalid, 5994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:29:35,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 10173 Invalid, 5994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5968 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-10 00:29:35,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2025-01-10 00:29:35,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2025-01-10 00:29:35,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1496 states, 1018 states have (on average 1.6895874263261297) internal successors, (1720), 1485 states have internal predecessors, (1720), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2025-01-10 00:29:35,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1750 transitions. [2025-01-10 00:29:35,738 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 1750 transitions. Word has length 85 [2025-01-10 00:29:35,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:29:35,738 INFO L471 AbstractCegarLoop]: Abstraction has 1496 states and 1750 transitions. [2025-01-10 00:29:35,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.083333333333334) internal successors, (121), 13 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 00:29:35,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1750 transitions. [2025-01-10 00:29:35,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-10 00:29:35,739 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:29:35,739 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:29:35,749 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:29:35,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 00:29:35,940 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:29:35,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:29:35,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1240902630, now seen corresponding path program 1 times [2025-01-10 00:29:35,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:29:35,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31383418] [2025-01-10 00:29:35,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:29:35,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:29:35,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 00:29:35,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 00:29:35,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:29:35,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:29:36,589 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:29:36,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:29:36,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31383418] [2025-01-10 00:29:36,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31383418] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:29:36,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281185999] [2025-01-10 00:29:36,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:29:36,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:29:36,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:29:36,592 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:29:36,594 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:29:36,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 00:29:36,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 00:29:36,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:29:36,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:29:36,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 00:29:36,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:29:36,841 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:29:36,951 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:29:36,963 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:29:36,964 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:29:36,994 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:29:37,005 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:29:37,105 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:29:37,110 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:29:37,240 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:29:37,241 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:29:37,249 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:29:37,293 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:29:37,298 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:29:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:29:37,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:29:37,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281185999] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:29:37,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:29:37,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2025-01-10 00:29:37,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92570575] [2025-01-10 00:29:37,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:29:37,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 00:29:37,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:29:37,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 00:29:37,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=348, Unknown=11, NotChecked=0, Total=420 [2025-01-10 00:29:37,467 INFO L87 Difference]: Start difference. First operand 1496 states and 1750 transitions. Second operand has 18 states, 15 states have (on average 8.866666666666667) internal successors, (133), 18 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:29:41,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:29:41,891 INFO L93 Difference]: Finished difference Result 1503 states and 1757 transitions. [2025-01-10 00:29:41,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:29:41,892 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 8.866666666666667) internal successors, (133), 18 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 85 [2025-01-10 00:29:41,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:29:41,899 INFO L225 Difference]: With dead ends: 1503 [2025-01-10 00:29:41,899 INFO L226 Difference]: Without dead ends: 1503 [2025-01-10 00:29:41,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=493, Unknown=12, NotChecked=0, Total=600 [2025-01-10 00:29:41,900 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 1535 mSDsluCounter, 9346 mSDsCounter, 0 mSdLazyCounter, 8933 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1550 SdHoareTripleChecker+Valid, 10389 SdHoareTripleChecker+Invalid, 8975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 8933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:29:41,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1550 Valid, 10389 Invalid, 8975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 8933 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-01-10 00:29:41,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2025-01-10 00:29:41,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1494. [2025-01-10 00:29:41,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 1017 states have (on average 1.6892822025565388) internal successors, (1718), 1483 states have internal predecessors, (1718), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:29:41,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1742 transitions. [2025-01-10 00:29:41,935 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1742 transitions. Word has length 85 [2025-01-10 00:29:41,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:29:41,935 INFO L471 AbstractCegarLoop]: Abstraction has 1494 states and 1742 transitions. [2025-01-10 00:29:41,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 8.866666666666667) internal successors, (133), 18 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:29:41,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1742 transitions. [2025-01-10 00:29:41,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-10 00:29:41,936 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:29:41,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:29:41,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 00:29:42,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 00:29:42,137 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:29:42,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:29:42,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1269842825, now seen corresponding path program 1 times [2025-01-10 00:29:42,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:29:42,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784417139] [2025-01-10 00:29:42,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:29:42,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:29:42,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-10 00:29:42,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-10 00:29:42,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:29:42,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:29:42,678 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:29:42,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:29:42,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784417139] [2025-01-10 00:29:42,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784417139] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:29:42,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:29:42,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-10 00:29:42,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540354053] [2025-01-10 00:29:42,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:29:42,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:29:42,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:29:42,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:29:42,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:29:42,682 INFO L87 Difference]: Start difference. First operand 1494 states and 1742 transitions. Second operand has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 13 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:29:45,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:29:45,383 INFO L93 Difference]: Finished difference Result 1507 states and 1761 transitions. [2025-01-10 00:29:45,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:29:45,384 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 13 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2025-01-10 00:29:45,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:29:45,388 INFO L225 Difference]: With dead ends: 1507 [2025-01-10 00:29:45,388 INFO L226 Difference]: Without dead ends: 1507 [2025-01-10 00:29:45,388 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:29:45,388 INFO L435 NwaCegarLoop]: 1037 mSDtfsCounter, 1555 mSDsluCounter, 10119 mSDsCounter, 0 mSdLazyCounter, 6575 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1570 SdHoareTripleChecker+Valid, 11156 SdHoareTripleChecker+Invalid, 6600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 6575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:29:45,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1570 Valid, 11156 Invalid, 6600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 6575 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-10 00:29:45,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2025-01-10 00:29:45,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1503. [2025-01-10 00:29:45,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1025 states have (on average 1.6858536585365853) internal successors, (1728), 1491 states have internal predecessors, (1728), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:29:45,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1753 transitions. [2025-01-10 00:29:45,408 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1753 transitions. Word has length 87 [2025-01-10 00:29:45,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:29:45,409 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 1753 transitions. [2025-01-10 00:29:45,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 13 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:29:45,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1753 transitions. [2025-01-10 00:29:45,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-10 00:29:45,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:29:45,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:29:45,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 00:29:45,410 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:29:45,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:29:45,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1269842824, now seen corresponding path program 1 times [2025-01-10 00:29:45,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:29:45,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239583726] [2025-01-10 00:29:45,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:29:45,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:29:45,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-10 00:29:45,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-10 00:29:45,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:29:45,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:29:45,992 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:29:45,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:29:45,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239583726] [2025-01-10 00:29:45,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239583726] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:29:45,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:29:45,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:29:45,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901142555] [2025-01-10 00:29:45,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:29:45,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:29:45,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:29:45,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:29:45,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:29:45,995 INFO L87 Difference]: Start difference. First operand 1503 states and 1753 transitions. Second operand has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:29:48,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:29:48,336 INFO L93 Difference]: Finished difference Result 1506 states and 1760 transitions. [2025-01-10 00:29:48,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:29:48,336 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2025-01-10 00:29:48,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:29:48,339 INFO L225 Difference]: With dead ends: 1506 [2025-01-10 00:29:48,339 INFO L226 Difference]: Without dead ends: 1506 [2025-01-10 00:29:48,339 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:29:48,339 INFO L435 NwaCegarLoop]: 1044 mSDtfsCounter, 1553 mSDsluCounter, 5207 mSDsCounter, 0 mSdLazyCounter, 5056 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1568 SdHoareTripleChecker+Valid, 6251 SdHoareTripleChecker+Invalid, 5080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:29:48,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1568 Valid, 6251 Invalid, 5080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5056 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-10 00:29:48,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-01-10 00:29:48,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1503. [2025-01-10 00:29:48,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1025 states have (on average 1.6848780487804877) internal successors, (1727), 1491 states have internal predecessors, (1727), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:29:48,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1752 transitions. [2025-01-10 00:29:48,363 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1752 transitions. Word has length 87 [2025-01-10 00:29:48,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:29:48,363 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 1752 transitions. [2025-01-10 00:29:48,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:29:48,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1752 transitions. [2025-01-10 00:29:48,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-10 00:29:48,364 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:29:48,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:29:48,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 00:29:48,365 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:29:48,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:29:48,366 INFO L85 PathProgramCache]: Analyzing trace with hash 947320555, now seen corresponding path program 1 times [2025-01-10 00:29:48,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:29:48,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868042352] [2025-01-10 00:29:48,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:29:48,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:29:48,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-10 00:29:48,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 00:29:48,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:29:48,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:29:48,839 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:29:48,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:29:48,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868042352] [2025-01-10 00:29:48,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868042352] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:29:48,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033579773] [2025-01-10 00:29:48,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:29:48,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:29:48,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:29:48,842 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:29:48,845 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:29:49,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-10 00:29:49,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 00:29:49,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:29:49,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:29:49,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 00:29:49,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:29:49,107 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:29:49,208 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:29:49,209 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:29:49,216 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:29:49,270 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:29:49,271 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:29:49,316 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:29:49,317 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:29:49,332 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:29:49,334 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:29:49,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:29:49,345 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_925 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_925) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-01-10 00:29:49,353 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_925 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_925) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-01-10 00:29:49,398 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-01-10 00:29:49,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2025-01-10 00:29:49,408 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_925 (Array Int Int)) (v_ArrVal_928 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_928))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_925)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2025-01-10 00:29:49,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033579773] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:29:49,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:29:49,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2025-01-10 00:29:49,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588934216] [2025-01-10 00:29:49,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:29:49,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 00:29:49,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:29:49,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 00:29:49,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=202, Unknown=3, NotChecked=90, Total=342 [2025-01-10 00:29:49,411 INFO L87 Difference]: Start difference. First operand 1503 states and 1752 transitions. Second operand has 16 states, 14 states have (on average 9.0) internal successors, (126), 15 states have internal predecessors, (126), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:29:52,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:29:52,245 INFO L93 Difference]: Finished difference Result 1505 states and 1759 transitions. [2025-01-10 00:29:52,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:29:52,246 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.0) internal successors, (126), 15 states have internal predecessors, (126), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2025-01-10 00:29:52,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:29:52,249 INFO L225 Difference]: With dead ends: 1505 [2025-01-10 00:29:52,249 INFO L226 Difference]: Without dead ends: 1505 [2025-01-10 00:29:52,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650 [2025-01-10 00:29:52,249 INFO L435 NwaCegarLoop]: 1037 mSDtfsCounter, 1527 mSDsluCounter, 11122 mSDsCounter, 0 mSdLazyCounter, 7173 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 12159 SdHoareTripleChecker+Invalid, 7198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 7173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:29:52,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 12159 Invalid, 7198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 7173 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-10 00:29:52,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2025-01-10 00:29:52,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1502. [2025-01-10 00:29:52,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1025 states have (on average 1.6839024390243902) internal successors, (1726), 1490 states have internal predecessors, (1726), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:29:52,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1751 transitions. [2025-01-10 00:29:52,271 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1751 transitions. Word has length 88 [2025-01-10 00:29:52,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:29:52,272 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 1751 transitions. [2025-01-10 00:29:52,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.0) internal successors, (126), 15 states have internal predecessors, (126), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:29:52,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1751 transitions. [2025-01-10 00:29:52,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-10 00:29:52,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:29:52,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:29:52,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 00:29:52,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:29:52,477 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:29:52,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:29:52,477 INFO L85 PathProgramCache]: Analyzing trace with hash 947320556, now seen corresponding path program 1 times [2025-01-10 00:29:52,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:29:52,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629235778] [2025-01-10 00:29:52,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:29:52,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:29:52,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-10 00:29:52,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 00:29:52,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:29:52,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:29:53,156 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:29:53,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:29:53,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629235778] [2025-01-10 00:29:53,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629235778] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:29:53,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851753500] [2025-01-10 00:29:53,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:29:53,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:29:53,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:29:53,159 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:29:53,162 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:29:53,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-10 00:29:53,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 00:29:53,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:29:53,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:29:53,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-10 00:29:53,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:29:53,384 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:29:53,485 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:29:53,485 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:29:53,493 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:29:53,505 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:29:53,513 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:29:53,569 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:29:53,573 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:29:53,659 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:29:53,659 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:29:53,664 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:29:53,727 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:29:53,727 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:29:53,732 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:29:53,749 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:29:53,754 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:29:53,758 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:29:53,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:29:53,816 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1069 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1070 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))))) is different from false [2025-01-10 00:29:53,828 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1069 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1070 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2025-01-10 00:29:53,883 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1076 (Array Int Int)) (v_ArrVal_1075 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1076) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1075) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1069 (Array Int Int)) (v_ArrVal_1076 (Array Int Int)) (v_ArrVal_1075 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1075))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1076) .cse1 v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-01-10 00:29:53,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851753500] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:29:53,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:29:53,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2025-01-10 00:29:53,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912019470] [2025-01-10 00:29:53,885 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:29:53,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 00:29:53,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:29:53,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 00:29:53,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=256, Unknown=3, NotChecked=102, Total=420 [2025-01-10 00:29:53,886 INFO L87 Difference]: Start difference. First operand 1502 states and 1751 transitions. Second operand has 16 states, 14 states have (on average 9.357142857142858) internal successors, (131), 16 states have internal predecessors, (131), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 00:29:56,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:29:56,254 INFO L93 Difference]: Finished difference Result 1504 states and 1758 transitions. [2025-01-10 00:29:56,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:29:56,254 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.357142857142858) internal successors, (131), 16 states have internal predecessors, (131), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2025-01-10 00:29:56,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:29:56,257 INFO L225 Difference]: With dead ends: 1504 [2025-01-10 00:29:56,257 INFO L226 Difference]: Without dead ends: 1504 [2025-01-10 00:29:56,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=420, Unknown=3, NotChecked=132, Total=650 [2025-01-10 00:29:56,258 INFO L435 NwaCegarLoop]: 1042 mSDtfsCounter, 1532 mSDsluCounter, 5205 mSDsCounter, 0 mSdLazyCounter, 5068 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1547 SdHoareTripleChecker+Valid, 6247 SdHoareTripleChecker+Invalid, 5107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 5068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:29:56,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1547 Valid, 6247 Invalid, 5107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 5068 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-10 00:29:56,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2025-01-10 00:29:56,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1492. [2025-01-10 00:29:56,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1017 states have (on average 1.6873156342182891) internal successors, (1716), 1481 states have internal predecessors, (1716), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:29:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1740 transitions. [2025-01-10 00:29:56,273 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1740 transitions. Word has length 88 [2025-01-10 00:29:56,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:29:56,273 INFO L471 AbstractCegarLoop]: Abstraction has 1492 states and 1740 transitions. [2025-01-10 00:29:56,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.357142857142858) internal successors, (131), 16 states have internal predecessors, (131), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 00:29:56,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1740 transitions. [2025-01-10 00:29:56,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-10 00:29:56,274 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:29:56,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:29:56,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 00:29:56,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:29:56,475 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:29:56,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:29:56,475 INFO L85 PathProgramCache]: Analyzing trace with hash 184967232, now seen corresponding path program 1 times [2025-01-10 00:29:56,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:29:56,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095043043] [2025-01-10 00:29:56,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:29:56,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:29:56,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-10 00:29:56,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-10 00:29:56,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:29:56,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:29:56,956 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:29:56,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:29:56,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095043043] [2025-01-10 00:29:56,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095043043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:29:56,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:29:56,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-10 00:29:56,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647397805] [2025-01-10 00:29:56,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:29:56,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 00:29:56,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:29:56,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 00:29:56,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-01-10 00:29:56,959 INFO L87 Difference]: Start difference. First operand 1492 states and 1740 transitions. Second operand has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:29:59,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:29:59,657 INFO L93 Difference]: Finished difference Result 1508 states and 1762 transitions. [2025-01-10 00:29:59,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:29:59,658 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2025-01-10 00:29:59,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:29:59,660 INFO L225 Difference]: With dead ends: 1508 [2025-01-10 00:29:59,661 INFO L226 Difference]: Without dead ends: 1508 [2025-01-10 00:29:59,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-01-10 00:29:59,662 INFO L435 NwaCegarLoop]: 1036 mSDtfsCounter, 1556 mSDsluCounter, 9129 mSDsCounter, 0 mSdLazyCounter, 5998 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1571 SdHoareTripleChecker+Valid, 10165 SdHoareTripleChecker+Invalid, 6023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 5998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:29:59,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1571 Valid, 10165 Invalid, 6023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 5998 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-10 00:29:59,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2025-01-10 00:29:59,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1504. [2025-01-10 00:29:59,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1028 states have (on average 1.6819066147859922) internal successors, (1729), 1492 states have internal predecessors, (1729), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:29:59,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1754 transitions. [2025-01-10 00:29:59,673 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1754 transitions. Word has length 90 [2025-01-10 00:29:59,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:29:59,674 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 1754 transitions. [2025-01-10 00:29:59,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:29:59,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1754 transitions. [2025-01-10 00:29:59,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-10 00:29:59,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:29:59,674 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:29:59,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 00:29:59,675 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:29:59,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:29:59,675 INFO L85 PathProgramCache]: Analyzing trace with hash 184967233, now seen corresponding path program 1 times [2025-01-10 00:29:59,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:29:59,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014964123] [2025-01-10 00:29:59,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:29:59,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:29:59,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-10 00:29:59,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-10 00:29:59,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:29:59,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:30:00,322 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:30:00,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:30:00,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014964123] [2025-01-10 00:30:00,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014964123] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:30:00,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:30:00,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 00:30:00,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540460864] [2025-01-10 00:30:00,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:30:00,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 00:30:00,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:30:00,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 00:30:00,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-10 00:30:00,325 INFO L87 Difference]: Start difference. First operand 1504 states and 1754 transitions. Second operand has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:30:03,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:30:03,128 INFO L93 Difference]: Finished difference Result 1507 states and 1761 transitions. [2025-01-10 00:30:03,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:30:03,129 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2025-01-10 00:30:03,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:30:03,132 INFO L225 Difference]: With dead ends: 1507 [2025-01-10 00:30:03,132 INFO L226 Difference]: Without dead ends: 1507 [2025-01-10 00:30:03,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-01-10 00:30:03,133 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 1537 mSDsluCounter, 6000 mSDsCounter, 0 mSdLazyCounter, 5869 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 7043 SdHoareTripleChecker+Invalid, 5893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:30:03,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1552 Valid, 7043 Invalid, 5893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5869 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-10 00:30:03,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2025-01-10 00:30:03,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1504. [2025-01-10 00:30:03,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1028 states have (on average 1.6809338521400778) internal successors, (1728), 1492 states have internal predecessors, (1728), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:30:03,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1753 transitions. [2025-01-10 00:30:03,145 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1753 transitions. Word has length 90 [2025-01-10 00:30:03,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:30:03,145 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 1753 transitions. [2025-01-10 00:30:03,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:30:03,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1753 transitions. [2025-01-10 00:30:03,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-10 00:30:03,145 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:30:03,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:30:03,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 00:30:03,146 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:30:03,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:30:03,146 INFO L85 PathProgramCache]: Analyzing trace with hash -602824372, now seen corresponding path program 1 times [2025-01-10 00:30:03,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:30:03,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106052780] [2025-01-10 00:30:03,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:30:03,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:30:03,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 00:30:03,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 00:30:03,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:30:03,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:30:03,673 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:30:03,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:30:03,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106052780] [2025-01-10 00:30:03,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106052780] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:30:03,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388818252] [2025-01-10 00:30:03,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:30:03,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:30:03,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:30:03,676 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:30:03,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 00:30:03,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 00:30:03,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 00:30:03,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:30:03,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:30:03,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-10 00:30:03,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:30:03,947 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:30:04,028 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:30:04,028 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:30:04,034 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:30:04,092 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:30:04,093 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:30:04,131 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:30:04,131 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:30:04,177 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:30:04,177 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:30:04,188 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:30:04,190 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:30:04,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:30:08,356 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2025-01-10 00:30:08,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2025-01-10 00:30:08,360 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1358 (Array Int Int)) (v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1361 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1361))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1357)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1358)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2025-01-10 00:30:08,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388818252] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:30:08,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:30:08,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 18 [2025-01-10 00:30:08,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215880672] [2025-01-10 00:30:08,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:30:08,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 00:30:08,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:30:08,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 00:30:08,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=401, Unknown=35, NotChecked=42, Total=552 [2025-01-10 00:30:08,363 INFO L87 Difference]: Start difference. First operand 1504 states and 1753 transitions. Second operand has 19 states, 17 states have (on average 8.058823529411764) internal successors, (137), 19 states have internal predecessors, (137), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 00:30:11,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:30:11,769 INFO L93 Difference]: Finished difference Result 1506 states and 1760 transitions. [2025-01-10 00:30:11,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 00:30:11,769 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.058823529411764) internal successors, (137), 19 states have internal predecessors, (137), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 91 [2025-01-10 00:30:11,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:30:11,772 INFO L225 Difference]: With dead ends: 1506 [2025-01-10 00:30:11,772 INFO L226 Difference]: Without dead ends: 1506 [2025-01-10 00:30:11,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=146, Invalid=753, Unknown=35, NotChecked=58, Total=992 [2025-01-10 00:30:11,773 INFO L435 NwaCegarLoop]: 1036 mSDtfsCounter, 1531 mSDsluCounter, 10141 mSDsCounter, 0 mSdLazyCounter, 6565 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 11177 SdHoareTripleChecker+Invalid, 6603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 6565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:30:11,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 11177 Invalid, 6603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 6565 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-10 00:30:11,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-01-10 00:30:11,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1503. [2025-01-10 00:30:11,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1028 states have (on average 1.6799610894941635) internal successors, (1727), 1491 states have internal predecessors, (1727), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:30:11,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1752 transitions. [2025-01-10 00:30:11,784 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1752 transitions. Word has length 91 [2025-01-10 00:30:11,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:30:11,784 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 1752 transitions. [2025-01-10 00:30:11,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.058823529411764) internal successors, (137), 19 states have internal predecessors, (137), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 00:30:11,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1752 transitions. [2025-01-10 00:30:11,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-10 00:30:11,788 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:30:11,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:30:11,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 00:30:11,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-10 00:30:11,989 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:30:11,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:30:11,990 INFO L85 PathProgramCache]: Analyzing trace with hash -602824371, now seen corresponding path program 1 times [2025-01-10 00:30:11,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:30:11,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80484704] [2025-01-10 00:30:11,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:30:11,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:30:12,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 00:30:12,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 00:30:12,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:30:12,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:30:12,674 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:30:12,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:30:12,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80484704] [2025-01-10 00:30:12,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80484704] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:30:12,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834347831] [2025-01-10 00:30:12,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:30:12,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:30:12,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:30:12,678 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:30:12,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 00:30:12,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 00:30:12,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 00:30:12,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:30:12,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:30:12,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-10 00:30:12,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:30:12,909 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:30:12,993 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:30:12,999 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:30:13,000 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:30:13,022 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:30:13,024 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:30:13,104 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:30:13,107 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:30:13,208 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:30:13,208 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:30:13,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-10 00:30:13,287 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:30:13,287 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:30:13,292 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:30:13,366 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:30:13,366 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:30:13,371 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:30:13,407 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:30:13,439 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:30:13,465 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:30:13,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:30:13,530 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1517 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-01-10 00:30:13,539 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1517 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-01-10 00:30:13,564 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1514 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1515) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1514) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1514 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1514))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1515) .cse1 v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-01-10 00:30:13,716 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1514 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1523))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1522) .cse0 v_ArrVal_1515) (select (select (store .cse1 .cse0 v_ArrVal_1514) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1517))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1514 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1523))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1514))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1522) .cse3 v_ArrVal_1515) .cse4 v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2025-01-10 00:30:13,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834347831] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:30:13,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:30:13,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2025-01-10 00:30:13,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638652155] [2025-01-10 00:30:13,719 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:30:13,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 00:30:13,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:30:13,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 00:30:13,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=508, Unknown=13, NotChecked=196, Total=812 [2025-01-10 00:30:13,720 INFO L87 Difference]: Start difference. First operand 1503 states and 1752 transitions. Second operand has 22 states, 19 states have (on average 7.631578947368421) internal successors, (145), 22 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:30:19,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:30:19,084 INFO L93 Difference]: Finished difference Result 1505 states and 1759 transitions. [2025-01-10 00:30:19,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:30:19,085 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.631578947368421) internal successors, (145), 22 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 91 [2025-01-10 00:30:19,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:30:19,088 INFO L225 Difference]: With dead ends: 1505 [2025-01-10 00:30:19,088 INFO L226 Difference]: Without dead ends: 1505 [2025-01-10 00:30:19,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=780, Unknown=13, NotChecked=244, Total=1190 [2025-01-10 00:30:19,089 INFO L435 NwaCegarLoop]: 1041 mSDtfsCounter, 1528 mSDsluCounter, 10377 mSDsCounter, 0 mSdLazyCounter, 9497 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1543 SdHoareTripleChecker+Valid, 11418 SdHoareTripleChecker+Invalid, 9527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 9497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:30:19,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1543 Valid, 11418 Invalid, 9527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 9497 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-01-10 00:30:19,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2025-01-10 00:30:19,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1490. [2025-01-10 00:30:19,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1017 states have (on average 1.6853490658800394) internal successors, (1714), 1479 states have internal predecessors, (1714), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 00:30:19,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1738 transitions. [2025-01-10 00:30:19,102 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1738 transitions. Word has length 91 [2025-01-10 00:30:19,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:30:19,102 INFO L471 AbstractCegarLoop]: Abstraction has 1490 states and 1738 transitions. [2025-01-10 00:30:19,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.631578947368421) internal successors, (145), 22 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:30:19,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1738 transitions. [2025-01-10 00:30:19,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-10 00:30:19,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:30:19,103 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:30:19,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 00:30:19,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-10 00:30:19,304 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:30:19,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:30:19,305 INFO L85 PathProgramCache]: Analyzing trace with hash -83601666, now seen corresponding path program 1 times [2025-01-10 00:30:19,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:30:19,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358513525] [2025-01-10 00:30:19,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:30:19,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:30:19,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 00:30:19,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 00:30:19,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:30:19,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:30:19,847 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:30:19,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:30:19,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358513525] [2025-01-10 00:30:19,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358513525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:30:19,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:30:19,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-10 00:30:19,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566428614] [2025-01-10 00:30:19,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:30:19,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 00:30:19,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:30:19,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 00:30:19,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-01-10 00:30:19,849 INFO L87 Difference]: Start difference. First operand 1490 states and 1738 transitions. Second operand has 16 states, 14 states have (on average 6.5) internal successors, (91), 15 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:30:22,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:30:22,689 INFO L93 Difference]: Finished difference Result 1509 states and 1763 transitions. [2025-01-10 00:30:22,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 00:30:22,689 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.5) internal successors, (91), 15 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2025-01-10 00:30:22,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:30:22,692 INFO L225 Difference]: With dead ends: 1509 [2025-01-10 00:30:22,692 INFO L226 Difference]: Without dead ends: 1509 [2025-01-10 00:30:22,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-01-10 00:30:22,693 INFO L435 NwaCegarLoop]: 1035 mSDtfsCounter, 1563 mSDsluCounter, 8104 mSDsCounter, 0 mSdLazyCounter, 5415 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 9139 SdHoareTripleChecker+Invalid, 5441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:30:22,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1578 Valid, 9139 Invalid, 5441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5415 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-10 00:30:22,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2025-01-10 00:30:22,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1505. [2025-01-10 00:30:22,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1031 states have (on average 1.6779825412221145) internal successors, (1730), 1493 states have internal predecessors, (1730), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:30:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1755 transitions. [2025-01-10 00:30:22,706 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1755 transitions. Word has length 93 [2025-01-10 00:30:22,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:30:22,706 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 1755 transitions. [2025-01-10 00:30:22,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.5) internal successors, (91), 15 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:30:22,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1755 transitions. [2025-01-10 00:30:22,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-10 00:30:22,707 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:30:22,707 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:30:22,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 00:30:22,707 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:30:22,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:30:22,707 INFO L85 PathProgramCache]: Analyzing trace with hash -83601665, now seen corresponding path program 1 times [2025-01-10 00:30:22,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:30:22,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409974112] [2025-01-10 00:30:22,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:30:22,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:30:22,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 00:30:22,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 00:30:22,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:30:22,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:30:23,466 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:30:23,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:30:23,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409974112] [2025-01-10 00:30:23,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409974112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:30:23,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:30:23,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-10 00:30:23,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923595932] [2025-01-10 00:30:23,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:30:23,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:30:23,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:30:23,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:30:23,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:30:23,468 INFO L87 Difference]: Start difference. First operand 1505 states and 1755 transitions. Second operand has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:30:26,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:30:26,333 INFO L93 Difference]: Finished difference Result 1508 states and 1762 transitions. [2025-01-10 00:30:26,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:30:26,333 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2025-01-10 00:30:26,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:30:26,335 INFO L225 Difference]: With dead ends: 1508 [2025-01-10 00:30:26,335 INFO L226 Difference]: Without dead ends: 1508 [2025-01-10 00:30:26,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-01-10 00:30:26,336 INFO L435 NwaCegarLoop]: 1042 mSDtfsCounter, 1556 mSDsluCounter, 5211 mSDsCounter, 0 mSdLazyCounter, 5053 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1571 SdHoareTripleChecker+Valid, 6253 SdHoareTripleChecker+Invalid, 5077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:30:26,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1571 Valid, 6253 Invalid, 5077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5053 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-10 00:30:26,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2025-01-10 00:30:26,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1505. [2025-01-10 00:30:26,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1031 states have (on average 1.6770126091173618) internal successors, (1729), 1493 states have internal predecessors, (1729), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-10 00:30:26,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1754 transitions. [2025-01-10 00:30:26,345 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1754 transitions. Word has length 93 [2025-01-10 00:30:26,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:30:26,345 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 1754 transitions. [2025-01-10 00:30:26,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:30:26,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1754 transitions. [2025-01-10 00:30:26,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-10 00:30:26,346 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:30:26,346 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:30:26,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 00:30:26,346 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-01-10 00:30:26,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:30:26,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1481971086, now seen corresponding path program 1 times [2025-01-10 00:30:26,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:30:26,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399506859] [2025-01-10 00:30:26,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:30:26,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:30:26,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 00:30:26,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 00:30:26,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:30:26,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:30:26,897 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:30:26,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:30:26,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399506859] [2025-01-10 00:30:26,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399506859] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:30:26,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563279282] [2025-01-10 00:30:26,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:30:26,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:30:26,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:30:26,900 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:30:26,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 00:30:27,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 00:30:27,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 00:30:27,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:30:27,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:30:27,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-10 00:30:27,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:30:27,172 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:30:27,281 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:30:27,282 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:30:27,289 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:30:27,368 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:30:27,368 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:30:27,412 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:30:27,413 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:30:27,457 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:30:27,458 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:30:27,505 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:30:27,506 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:30:27,521 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:30:27,524 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:30:27,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:30:27,608 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1829 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1829))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1830)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:30:27,615 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1829 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1829))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1830)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:30:27,687 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1829 (Array Int Int)) (v_ArrVal_1828 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1828))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1829)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1830)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:30:27,729 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2025-01-10 00:30:27,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 104 [2025-01-10 00:30:27,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563279282] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:30:27,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:30:27,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 20 [2025-01-10 00:30:27,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484205051] [2025-01-10 00:30:27,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:30:27,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 00:30:27,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:30:27,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 00:30:27,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=481, Unknown=42, NotChecked=144, Total=756 [2025-01-10 00:30:27,781 INFO L87 Difference]: Start difference. First operand 1505 states and 1754 transitions. Second operand has 21 states, 19 states have (on average 7.473684210526316) internal successors, (142), 21 states have internal predecessors, (142), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)