./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-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 ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:19:15,428 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:19:15,487 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:19:15,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:19:15,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:19:15,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:19:15,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:19:15,515 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:19:15,515 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:19:15,515 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:19:15,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:19:15,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:19:15,516 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:19:15,516 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:19:15,517 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:19:15,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:19:15,517 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:19:15,517 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:19:15,517 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:19:15,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:19:15,518 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:19:15,518 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:19:15,518 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:19:15,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:19:15,518 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:19:15,518 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:19:15,518 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:19:15,518 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:19:15,518 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:19:15,518 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:19:15,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:19:15,518 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:19:15,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:19:15,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:19:15,518 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:19:15,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:19:15,518 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:19:15,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:19:15,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:19:15,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:19:15,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:19:15,519 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:19:15,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:19:15,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:19:15,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:19:15,519 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:19:15,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:19:15,519 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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2025-01-10 00:19:15,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:19:15,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:19:15,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:19:15,757 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:19:15,758 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:19:15,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-1.i [2025-01-10 00:19:16,892 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/397b829d3/2e31f0e4679e428b9153746a34985fc2/FLAG889125ed7 [2025-01-10 00:19:17,252 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:19:17,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-1.i [2025-01-10 00:19:17,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/397b829d3/2e31f0e4679e428b9153746a34985fc2/FLAG889125ed7 [2025-01-10 00:19:17,465 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/397b829d3/2e31f0e4679e428b9153746a34985fc2 [2025-01-10 00:19:17,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:19:17,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:19:17,469 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:19:17,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:19:17,471 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:19:17,472 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:19:17" (1/1) ... [2025-01-10 00:19:17,472 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e131198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:19:17, skipping insertion in model container [2025-01-10 00:19:17,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:19:17" (1/1) ... [2025-01-10 00:19:17,498 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:19:17,718 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:19:17,744 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:19:17,747 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:19:17,752 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:19:17,757 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:19:17,783 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:19:17,787 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:19:17,790 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:19:17,798 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:19:17,813 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:19:17,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:19:17,830 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:19:17,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:19:17,918 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:19:17,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:19:17 WrapperNode [2025-01-10 00:19:17,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:19:17,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:19:17,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:19:17,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:19:17,924 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:19:17" (1/1) ... [2025-01-10 00:19:17,947 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:19:17" (1/1) ... [2025-01-10 00:19:18,001 INFO L138 Inliner]: procedures = 176, calls = 326, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1517 [2025-01-10 00:19:18,006 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:19:18,006 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:19:18,006 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:19:18,006 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:19:18,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:19:17" (1/1) ... [2025-01-10 00:19:18,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:19:17" (1/1) ... [2025-01-10 00:19:18,030 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:19:17" (1/1) ... [2025-01-10 00:19:18,098 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2025-01-10 00:19:18,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:19:17" (1/1) ... [2025-01-10 00:19:18,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:19:17" (1/1) ... [2025-01-10 00:19:18,133 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:19:17" (1/1) ... [2025-01-10 00:19:18,136 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:19:17" (1/1) ... [2025-01-10 00:19:18,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:19:17" (1/1) ... [2025-01-10 00:19:18,148 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:19:17" (1/1) ... [2025-01-10 00:19:18,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:19:17" (1/1) ... [2025-01-10 00:19:18,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:19:18,158 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:19:18,158 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:19:18,158 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:19:18,159 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:19:17" (1/1) ... [2025-01-10 00:19:18,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:19:18,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:19:18,185 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:19:18,188 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:19:18,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:19:18,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:19:18,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:19:18,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:19:18,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 00:19:18,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 00:19:18,209 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 00:19:18,209 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 00:19:18,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:19:18,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:19:18,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:19:18,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:19:18,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:19:18,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:19:18,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:19:18,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:19:18,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:19:18,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:19:18,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:19:18,382 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:19:18,384 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:19:18,386 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:19:18,421 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:19:20,170 INFO L? ?]: Removed 1493 outVars from TransFormulas that were not future-live. [2025-01-10 00:19:20,170 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:19:20,220 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:19:20,220 INFO L312 CfgBuilder]: Removed 28 assume(true) statements. [2025-01-10 00:19:20,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:19:20 BoogieIcfgContainer [2025-01-10 00:19:20,220 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:19:20,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:19:20,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:19:20,226 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:19:20,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:19:17" (1/3) ... [2025-01-10 00:19:20,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1c4529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:19:20, skipping insertion in model container [2025-01-10 00:19:20,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:19:17" (2/3) ... [2025-01-10 00:19:20,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1c4529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:19:20, skipping insertion in model container [2025-01-10 00:19:20,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:19:20" (3/3) ... [2025-01-10 00:19:20,228 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test4-1.i [2025-01-10 00:19:20,238 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:19:20,239 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_nondet_test4-1.i that has 3 procedures, 1431 locations, 1 initial locations, 36 loop locations, and 628 error locations. [2025-01-10 00:19:20,290 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:19:20,300 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;@4c842cc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:19:20,300 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2025-01-10 00:19:20,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 1426 states, 796 states have (on average 2.077889447236181) internal successors, (1654), 1418 states have internal predecessors, (1654), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 00:19:20,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 00:19:20,312 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:19:20,312 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 00:19:20,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr627ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:19:20,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:19:20,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1482238, now seen corresponding path program 1 times [2025-01-10 00:19:20,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:19:20,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164331950] [2025-01-10 00:19:20,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:20,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:19:20,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:19:20,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:19:20,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:20,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:20,425 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:19:20,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:19:20,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164331950] [2025-01-10 00:19:20,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164331950] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:19:20,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:19:20,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:19:20,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759881698] [2025-01-10 00:19:20,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:19:20,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:19:20,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:19:20,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:19:20,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:19:20,447 INFO L87 Difference]: Start difference. First operand has 1426 states, 796 states have (on average 2.077889447236181) internal successors, (1654), 1418 states have internal predecessors, (1654), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:19:21,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:19:21,057 INFO L93 Difference]: Finished difference Result 1429 states and 1609 transitions. [2025-01-10 00:19:21,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:19:21,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-01-10 00:19:21,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:19:21,077 INFO L225 Difference]: With dead ends: 1429 [2025-01-10 00:19:21,078 INFO L226 Difference]: Without dead ends: 1426 [2025-01-10 00:19:21,079 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:19:21,081 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 24 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 2538 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:19:21,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 2538 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 00:19:21,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2025-01-10 00:19:21,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1417. [2025-01-10 00:19:21,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 798 states have (on average 1.9924812030075187) internal successors, (1590), 1409 states have internal predecessors, (1590), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 00:19:21,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1602 transitions. [2025-01-10 00:19:21,182 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 1602 transitions. Word has length 4 [2025-01-10 00:19:21,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:19:21,182 INFO L471 AbstractCegarLoop]: Abstraction has 1417 states and 1602 transitions. [2025-01-10 00:19:21,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:19:21,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1602 transitions. [2025-01-10 00:19:21,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 00:19:21,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:19:21,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:19:21,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:19:21,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:19:21,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:19:21,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1424529203, now seen corresponding path program 1 times [2025-01-10 00:19:21,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:19:21,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030713444] [2025-01-10 00:19:21,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:21,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:19:21,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:19:21,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:19:21,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:21,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:21,293 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:19:21,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:19:21,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030713444] [2025-01-10 00:19:21,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030713444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:19:21,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:19:21,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:19:21,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23594891] [2025-01-10 00:19:21,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:19:21,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:19:21,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:19:21,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:19:21,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:19:21,296 INFO L87 Difference]: Start difference. First operand 1417 states and 1602 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:19:21,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:19:21,715 INFO L93 Difference]: Finished difference Result 2314 states and 2643 transitions. [2025-01-10 00:19:21,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:19:21,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 00:19:21,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:19:21,722 INFO L225 Difference]: With dead ends: 2314 [2025-01-10 00:19:21,723 INFO L226 Difference]: Without dead ends: 2313 [2025-01-10 00:19:21,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:19:21,724 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 1054 mSDsluCounter, 2819 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 4398 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:19:21,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 4398 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 00:19:21,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2025-01-10 00:19:21,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 1954. [2025-01-10 00:19:21,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1335 states have (on average 1.9655430711610486) internal successors, (2624), 1943 states have internal predecessors, (2624), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 00:19:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2642 transitions. [2025-01-10 00:19:21,764 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2642 transitions. Word has length 6 [2025-01-10 00:19:21,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:19:21,765 INFO L471 AbstractCegarLoop]: Abstraction has 1954 states and 2642 transitions. [2025-01-10 00:19:21,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:19:21,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2642 transitions. [2025-01-10 00:19:21,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 00:19:21,766 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:19:21,766 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:19:21,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:19:21,767 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:19:21,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:19:21,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1422072554, now seen corresponding path program 1 times [2025-01-10 00:19:21,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:19:21,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688661565] [2025-01-10 00:19:21,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:21,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:19:21,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:19:21,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:19:21,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:21,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:21,842 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:19:21,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:19:21,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688661565] [2025-01-10 00:19:21,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688661565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:19:21,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:19:21,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:19:21,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721237719] [2025-01-10 00:19:21,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:19:21,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:19:21,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:19:21,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:19:21,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:19:21,846 INFO L87 Difference]: Start difference. First operand 1954 states and 2642 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:19:22,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:19:22,777 INFO L93 Difference]: Finished difference Result 1860 states and 2498 transitions. [2025-01-10 00:19:22,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:19:22,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 00:19:22,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:19:22,784 INFO L225 Difference]: With dead ends: 1860 [2025-01-10 00:19:22,784 INFO L226 Difference]: Without dead ends: 1860 [2025-01-10 00:19:22,785 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:19:22,785 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 1348 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1354 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:19:22,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1354 Valid, 879 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-10 00:19:22,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2025-01-10 00:19:22,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1860. [2025-01-10 00:19:22,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1860 states, 1335 states have (on average 1.857677902621723) internal successors, (2480), 1849 states have internal predecessors, (2480), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 00:19:22,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 2498 transitions. [2025-01-10 00:19:22,821 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 2498 transitions. Word has length 6 [2025-01-10 00:19:22,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:19:22,821 INFO L471 AbstractCegarLoop]: Abstraction has 1860 states and 2498 transitions. [2025-01-10 00:19:22,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:19:22,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 2498 transitions. [2025-01-10 00:19:22,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 00:19:22,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:19:22,822 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:19:22,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:19:22,822 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:19:22,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:19:22,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1422072555, now seen corresponding path program 1 times [2025-01-10 00:19:22,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:19:22,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899932966] [2025-01-10 00:19:22,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:22,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:19:22,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:19:22,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:19:22,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:22,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:22,892 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:19:22,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:19:22,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899932966] [2025-01-10 00:19:22,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899932966] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:19:22,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:19:22,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:19:22,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722785672] [2025-01-10 00:19:22,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:19:22,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:19:22,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:19:22,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:19:22,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:19:22,894 INFO L87 Difference]: Start difference. First operand 1860 states and 2498 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:19:23,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:19:23,722 INFO L93 Difference]: Finished difference Result 2488 states and 3347 transitions. [2025-01-10 00:19:23,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:19:23,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 00:19:23,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:19:23,729 INFO L225 Difference]: With dead ends: 2488 [2025-01-10 00:19:23,730 INFO L226 Difference]: Without dead ends: 2488 [2025-01-10 00:19:23,730 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:19:23,730 INFO L435 NwaCegarLoop]: 1332 mSDtfsCounter, 817 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:19:23,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 1950 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 00:19:23,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2488 states. [2025-01-10 00:19:23,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2488 to 2334. [2025-01-10 00:19:23,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2334 states, 1819 states have (on average 1.8174821330401318) internal successors, (3306), 2323 states have internal predecessors, (3306), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 00:19:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 2334 states and 3324 transitions. [2025-01-10 00:19:23,775 INFO L78 Accepts]: Start accepts. Automaton has 2334 states and 3324 transitions. Word has length 6 [2025-01-10 00:19:23,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:19:23,776 INFO L471 AbstractCegarLoop]: Abstraction has 2334 states and 3324 transitions. [2025-01-10 00:19:23,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:19:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 3324 transitions. [2025-01-10 00:19:23,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 00:19:23,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:19:23,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:19:23,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:19:23,777 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:19:23,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:19:23,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1127332468, now seen corresponding path program 1 times [2025-01-10 00:19:23,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:19:23,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267830853] [2025-01-10 00:19:23,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:23,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:19:23,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:19:23,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:19:23,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:23,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:23,834 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:19:23,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:19:23,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267830853] [2025-01-10 00:19:23,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267830853] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:19:23,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:19:23,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:19:23,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77518940] [2025-01-10 00:19:23,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:19:23,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:19:23,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:19:23,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:19:23,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:19:23,835 INFO L87 Difference]: Start difference. First operand 2334 states and 3324 transitions. Second operand has 4 states, 3 states have (on average 4.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:19:24,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:19:24,737 INFO L93 Difference]: Finished difference Result 2409 states and 3430 transitions. [2025-01-10 00:19:24,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:19:24,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.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:19:24,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:19:24,746 INFO L225 Difference]: With dead ends: 2409 [2025-01-10 00:19:24,746 INFO L226 Difference]: Without dead ends: 2409 [2025-01-10 00:19:24,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:19:24,748 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 1615 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1621 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:19:24,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1621 Valid, 1560 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-10 00:19:24,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2409 states. [2025-01-10 00:19:24,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2409 to 2311. [2025-01-10 00:19:24,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2311 states, 1819 states have (on average 1.7921935129191864) internal successors, (3260), 2300 states have internal predecessors, (3260), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 00:19:24,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 2311 states and 3278 transitions. [2025-01-10 00:19:24,782 INFO L78 Accepts]: Start accepts. Automaton has 2311 states and 3278 transitions. Word has length 12 [2025-01-10 00:19:24,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:19:24,782 INFO L471 AbstractCegarLoop]: Abstraction has 2311 states and 3278 transitions. [2025-01-10 00:19:24,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.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:19:24,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 3278 transitions. [2025-01-10 00:19:24,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 00:19:24,783 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:19:24,783 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:19:24,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:19:24,783 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:19:24,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:19:24,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1127332469, now seen corresponding path program 1 times [2025-01-10 00:19:24,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:19:24,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021923819] [2025-01-10 00:19:24,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:24,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:19:24,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:19:24,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:19:24,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:24,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:24,863 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:19:24,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:19:24,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021923819] [2025-01-10 00:19:24,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021923819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:19:24,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:19:24,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:19:24,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884002004] [2025-01-10 00:19:24,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:19:24,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:19:24,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:19:24,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:19:24,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:19:24,865 INFO L87 Difference]: Start difference. First operand 2311 states and 3278 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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:19:24,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:19:24,886 INFO L93 Difference]: Finished difference Result 2173 states and 3072 transitions. [2025-01-10 00:19:24,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:19:24,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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:19:24,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:19:24,892 INFO L225 Difference]: With dead ends: 2173 [2025-01-10 00:19:24,892 INFO L226 Difference]: Without dead ends: 2173 [2025-01-10 00:19:24,892 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:19:24,893 INFO L435 NwaCegarLoop]: 1340 mSDtfsCounter, 60 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 2627 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:19:24,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 2627 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:19:24,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2025-01-10 00:19:24,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 2173. [2025-01-10 00:19:24,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2173 states, 1693 states have (on average 1.8038984051978737) internal successors, (3054), 2162 states have internal predecessors, (3054), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 00:19:24,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 2173 states and 3072 transitions. [2025-01-10 00:19:24,923 INFO L78 Accepts]: Start accepts. Automaton has 2173 states and 3072 transitions. Word has length 12 [2025-01-10 00:19:24,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:19:24,923 INFO L471 AbstractCegarLoop]: Abstraction has 2173 states and 3072 transitions. [2025-01-10 00:19:24,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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:19:24,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 3072 transitions. [2025-01-10 00:19:24,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 00:19:24,924 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:19:24,924 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:19:24,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:19:24,925 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:19:24,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:19:24,925 INFO L85 PathProgramCache]: Analyzing trace with hash 587783714, now seen corresponding path program 1 times [2025-01-10 00:19:24,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:19:24,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894206704] [2025-01-10 00:19:24,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:24,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:19:24,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:19:24,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:19:24,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:24,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:24,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:19:24,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:19:24,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894206704] [2025-01-10 00:19:24,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894206704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:19:24,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:19:24,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:19:24,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150230808] [2025-01-10 00:19:24,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:19:24,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:19:24,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:19:24,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:19:24,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:19:24,990 INFO L87 Difference]: Start difference. First operand 2173 states and 3072 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:19:25,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:19:25,051 INFO L93 Difference]: Finished difference Result 2144 states and 3022 transitions. [2025-01-10 00:19:25,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:19:25,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2025-01-10 00:19:25,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:19:25,056 INFO L225 Difference]: With dead ends: 2144 [2025-01-10 00:19:25,057 INFO L226 Difference]: Without dead ends: 2144 [2025-01-10 00:19:25,057 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:19:25,058 INFO L435 NwaCegarLoop]: 1305 mSDtfsCounter, 41 mSDsluCounter, 2582 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3887 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:19:25,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3887 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:19:25,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2144 states. [2025-01-10 00:19:25,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2144 to 2138. [2025-01-10 00:19:25,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2138 states, 1665 states have (on average 1.8006006006006006) internal successors, (2998), 2127 states have internal predecessors, (2998), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 00:19:25,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 3016 transitions. [2025-01-10 00:19:25,085 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 3016 transitions. Word has length 13 [2025-01-10 00:19:25,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:19:25,085 INFO L471 AbstractCegarLoop]: Abstraction has 2138 states and 3016 transitions. [2025-01-10 00:19:25,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:19:25,085 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 3016 transitions. [2025-01-10 00:19:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 00:19:25,085 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:19:25,085 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] [2025-01-10 00:19:25,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:19:25,086 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:19:25,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:19:25,086 INFO L85 PathProgramCache]: Analyzing trace with hash 2120190768, now seen corresponding path program 1 times [2025-01-10 00:19:25,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:19:25,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161977371] [2025-01-10 00:19:25,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:25,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:19:25,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 00:19:25,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 00:19:25,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:25,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:25,231 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:19:25,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:19:25,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161977371] [2025-01-10 00:19:25,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161977371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:19:25,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:19:25,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:19:25,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399465512] [2025-01-10 00:19:25,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:19:25,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:19:25,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:19:25,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:19:25,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:19:25,236 INFO L87 Difference]: Start difference. First operand 2138 states and 3016 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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:19:26,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:19:26,142 INFO L93 Difference]: Finished difference Result 2386 states and 3183 transitions. [2025-01-10 00:19:26,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:19:26,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2025-01-10 00:19:26,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:19:26,147 INFO L225 Difference]: With dead ends: 2386 [2025-01-10 00:19:26,147 INFO L226 Difference]: Without dead ends: 2386 [2025-01-10 00:19:26,147 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:19:26,148 INFO L435 NwaCegarLoop]: 1216 mSDtfsCounter, 822 mSDsluCounter, 1393 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 2609 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:19:26,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 2609 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-10 00:19:26,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2025-01-10 00:19:26,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2134. [2025-01-10 00:19:26,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2134 states, 1665 states have (on average 1.7957957957957957) internal successors, (2990), 2123 states have internal predecessors, (2990), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 00:19:26,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 2134 states and 3008 transitions. [2025-01-10 00:19:26,170 INFO L78 Accepts]: Start accepts. Automaton has 2134 states and 3008 transitions. Word has length 27 [2025-01-10 00:19:26,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:19:26,171 INFO L471 AbstractCegarLoop]: Abstraction has 2134 states and 3008 transitions. [2025-01-10 00:19:26,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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:19:26,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2134 states and 3008 transitions. [2025-01-10 00:19:26,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-10 00:19:26,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:19:26,172 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] [2025-01-10 00:19:26,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:19:26,172 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:19:26,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:19:26,172 INFO L85 PathProgramCache]: Analyzing trace with hash 2144314855, now seen corresponding path program 1 times [2025-01-10 00:19:26,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:19:26,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209132032] [2025-01-10 00:19:26,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:26,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:19:26,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-10 00:19:26,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-10 00:19:26,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:26,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:26,283 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:19:26,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:19:26,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209132032] [2025-01-10 00:19:26,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209132032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:19:26,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:19:26,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:19:26,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497383566] [2025-01-10 00:19:26,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:19:26,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:19:26,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:19:26,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:19:26,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:19:26,286 INFO L87 Difference]: Start difference. First operand 2134 states and 3008 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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:19:26,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:19:26,338 INFO L93 Difference]: Finished difference Result 2134 states and 3000 transitions. [2025-01-10 00:19:26,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:19:26,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2025-01-10 00:19:26,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:19:26,343 INFO L225 Difference]: With dead ends: 2134 [2025-01-10 00:19:26,343 INFO L226 Difference]: Without dead ends: 2134 [2025-01-10 00:19:26,343 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:19:26,344 INFO L435 NwaCegarLoop]: 1300 mSDtfsCounter, 21 mSDsluCounter, 2569 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3869 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:19:26,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3869 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:19:26,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2025-01-10 00:19:26,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 2134. [2025-01-10 00:19:26,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2134 states, 1665 states have (on average 1.790990990990991) internal successors, (2982), 2123 states have internal predecessors, (2982), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 00:19:26,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 2134 states and 3000 transitions. [2025-01-10 00:19:26,366 INFO L78 Accepts]: Start accepts. Automaton has 2134 states and 3000 transitions. Word has length 61 [2025-01-10 00:19:26,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:19:26,367 INFO L471 AbstractCegarLoop]: Abstraction has 2134 states and 3000 transitions. [2025-01-10 00:19:26,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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:19:26,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2134 states and 3000 transitions. [2025-01-10 00:19:26,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-10 00:19:26,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:19:26,368 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] [2025-01-10 00:19:26,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:19:26,368 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:19:26,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:19:26,369 INFO L85 PathProgramCache]: Analyzing trace with hash -547227213, now seen corresponding path program 1 times [2025-01-10 00:19:26,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:19:26,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517691421] [2025-01-10 00:19:26,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:26,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:19:26,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-10 00:19:26,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 00:19:26,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:26,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:26,492 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:19:26,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:19:26,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517691421] [2025-01-10 00:19:26,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517691421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:19:26,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:19:26,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:19:26,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754815891] [2025-01-10 00:19:26,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:19:26,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:19:26,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:19:26,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:19:26,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:19:26,494 INFO L87 Difference]: Start difference. First operand 2134 states and 3000 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:19:26,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:19:26,524 INFO L93 Difference]: Finished difference Result 1904 states and 2598 transitions. [2025-01-10 00:19:26,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:19:26,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 69 [2025-01-10 00:19:26,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:19:26,529 INFO L225 Difference]: With dead ends: 1904 [2025-01-10 00:19:26,529 INFO L226 Difference]: Without dead ends: 1904 [2025-01-10 00:19:26,529 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:19:26,530 INFO L435 NwaCegarLoop]: 1314 mSDtfsCounter, 54 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2600 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:19:26,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2600 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:19:26,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2025-01-10 00:19:26,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1904. [2025-01-10 00:19:26,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1904 states, 1435 states have (on average 1.7979094076655053) internal successors, (2580), 1893 states have internal predecessors, (2580), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 00:19:26,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 2598 transitions. [2025-01-10 00:19:26,548 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 2598 transitions. Word has length 69 [2025-01-10 00:19:26,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:19:26,548 INFO L471 AbstractCegarLoop]: Abstraction has 1904 states and 2598 transitions. [2025-01-10 00:19:26,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:19:26,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 2598 transitions. [2025-01-10 00:19:26,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-10 00:19:26,549 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:19:26,549 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] [2025-01-10 00:19:26,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:19:26,550 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:19:26,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:19:26,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1140864624, now seen corresponding path program 1 times [2025-01-10 00:19:26,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:19:26,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691059630] [2025-01-10 00:19:26,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:26,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:19:26,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-10 00:19:26,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 00:19:26,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:26,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:26,899 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:19:26,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:19:26,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691059630] [2025-01-10 00:19:26,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691059630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:19:26,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:19:26,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:19:26,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614064613] [2025-01-10 00:19:26,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:19:26,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:19:26,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:19:26,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:19:26,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:19:26,900 INFO L87 Difference]: Start difference. First operand 1904 states and 2598 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 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:19:27,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:19:27,910 INFO L93 Difference]: Finished difference Result 1820 states and 2473 transitions. [2025-01-10 00:19:27,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:19:27,910 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 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 72 [2025-01-10 00:19:27,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:19:27,915 INFO L225 Difference]: With dead ends: 1820 [2025-01-10 00:19:27,915 INFO L226 Difference]: Without dead ends: 1820 [2025-01-10 00:19:27,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:19:27,916 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 2262 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2268 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:19:27,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2268 Valid, 1097 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-10 00:19:27,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2025-01-10 00:19:27,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1548. [2025-01-10 00:19:27,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1163 states have (on average 1.6956147893379192) internal successors, (1972), 1537 states have internal predecessors, (1972), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 00:19:27,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 1990 transitions. [2025-01-10 00:19:27,934 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 1990 transitions. Word has length 72 [2025-01-10 00:19:27,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:19:27,934 INFO L471 AbstractCegarLoop]: Abstraction has 1548 states and 1990 transitions. [2025-01-10 00:19:27,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 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:19:27,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 1990 transitions. [2025-01-10 00:19:27,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-10 00:19:27,936 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:19:27,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] [2025-01-10 00:19:27,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:19:27,936 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:19:27,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:19:27,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1081154117, now seen corresponding path program 1 times [2025-01-10 00:19:27,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:19:27,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836777281] [2025-01-10 00:19:27,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:27,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:19:27,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-10 00:19:27,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-10 00:19:27,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:27,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:28,156 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:19:28,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:19:28,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836777281] [2025-01-10 00:19:28,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836777281] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:19:28,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:19:28,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:19:28,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406194279] [2025-01-10 00:19:28,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:19:28,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:19:28,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:19:28,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:19:28,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:19:28,157 INFO L87 Difference]: Start difference. First operand 1548 states and 1990 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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:19:28,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:19:28,903 INFO L93 Difference]: Finished difference Result 1547 states and 1988 transitions. [2025-01-10 00:19:28,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:19:28,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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 77 [2025-01-10 00:19:28,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:19:28,911 INFO L225 Difference]: With dead ends: 1547 [2025-01-10 00:19:28,911 INFO L226 Difference]: Without dead ends: 1547 [2025-01-10 00:19:28,911 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:19:28,911 INFO L435 NwaCegarLoop]: 1226 mSDtfsCounter, 2 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3444 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:19:28,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3444 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 00:19:28,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2025-01-10 00:19:28,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1547. [2025-01-10 00:19:28,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1163 states have (on average 1.6938950988822012) internal successors, (1970), 1536 states have internal predecessors, (1970), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 00:19:28,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 1988 transitions. [2025-01-10 00:19:28,927 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 1988 transitions. Word has length 77 [2025-01-10 00:19:28,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:19:28,927 INFO L471 AbstractCegarLoop]: Abstraction has 1547 states and 1988 transitions. [2025-01-10 00:19:28,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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:19:28,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 1988 transitions. [2025-01-10 00:19:28,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-10 00:19:28,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:19:28,928 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] [2025-01-10 00:19:28,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:19:28,928 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:19:28,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:19:28,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1081154118, now seen corresponding path program 1 times [2025-01-10 00:19:28,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:19:28,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529641174] [2025-01-10 00:19:28,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:28,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:19:28,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-10 00:19:28,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-10 00:19:28,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:28,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:29,299 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:19:29,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:19:29,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529641174] [2025-01-10 00:19:29,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529641174] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:19:29,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:19:29,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:19:29,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137455654] [2025-01-10 00:19:29,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:19:29,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:19:29,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:19:29,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:19:29,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:19:29,300 INFO L87 Difference]: Start difference. First operand 1547 states and 1988 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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:19:30,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:19:30,186 INFO L93 Difference]: Finished difference Result 1546 states and 1986 transitions. [2025-01-10 00:19:30,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:19:30,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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 77 [2025-01-10 00:19:30,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:19:30,191 INFO L225 Difference]: With dead ends: 1546 [2025-01-10 00:19:30,191 INFO L226 Difference]: Without dead ends: 1546 [2025-01-10 00:19:30,191 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:19:30,191 INFO L435 NwaCegarLoop]: 1226 mSDtfsCounter, 1 mSDsluCounter, 2233 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3459 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:19:30,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3459 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 00:19:30,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2025-01-10 00:19:30,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1546. [2025-01-10 00:19:30,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1161 states have (on average 1.6950904392764858) internal successors, (1968), 1535 states have internal predecessors, (1968), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 00:19:30,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1986 transitions. [2025-01-10 00:19:30,207 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 1986 transitions. Word has length 77 [2025-01-10 00:19:30,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:19:30,208 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 1986 transitions. [2025-01-10 00:19:30,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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:19:30,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 1986 transitions. [2025-01-10 00:19:30,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-10 00:19:30,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:19:30,208 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:19:30,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:19:30,209 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:19:30,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:19:30,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1883449964, now seen corresponding path program 1 times [2025-01-10 00:19:30,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:19:30,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781233967] [2025-01-10 00:19:30,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:30,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:19:30,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 00:19:30,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 00:19:30,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:30,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:30,453 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:19:30,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:19:30,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781233967] [2025-01-10 00:19:30,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781233967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:19:30,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:19:30,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:19:30,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054451448] [2025-01-10 00:19:30,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:19:30,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:19:30,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:19:30,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:19:30,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:19:30,456 INFO L87 Difference]: Start difference. First operand 1546 states and 1986 transitions. Second operand has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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:19:31,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:19:31,433 INFO L93 Difference]: Finished difference Result 1564 states and 2016 transitions. [2025-01-10 00:19:31,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:19:31,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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 85 [2025-01-10 00:19:31,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:19:31,441 INFO L225 Difference]: With dead ends: 1564 [2025-01-10 00:19:31,441 INFO L226 Difference]: Without dead ends: 1564 [2025-01-10 00:19:31,442 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:19:31,442 INFO L435 NwaCegarLoop]: 1215 mSDtfsCounter, 6 mSDsluCounter, 4218 mSDsCounter, 0 mSdLazyCounter, 1930 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5433 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:19:31,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5433 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1930 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-10 00:19:31,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2025-01-10 00:19:31,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1555. [2025-01-10 00:19:31,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1169 states have (on average 1.6928999144568007) internal successors, (1979), 1542 states have internal predecessors, (1979), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2025-01-10 00:19:31,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2006 transitions. [2025-01-10 00:19:31,467 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2006 transitions. Word has length 85 [2025-01-10 00:19:31,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:19:31,467 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2006 transitions. [2025-01-10 00:19:31,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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:19:31,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2006 transitions. [2025-01-10 00:19:31,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-10 00:19:31,467 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:19:31,470 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:19:31,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:19:31,471 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:19:31,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:19:31,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1883449965, now seen corresponding path program 1 times [2025-01-10 00:19:31,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:19:31,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849483280] [2025-01-10 00:19:31,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:31,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:19:31,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 00:19:31,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 00:19:31,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:31,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:31,841 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:19:31,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:19:31,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849483280] [2025-01-10 00:19:31,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849483280] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:19:31,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:19:31,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:19:31,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934316114] [2025-01-10 00:19:31,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:19:31,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:19:31,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:19:31,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:19:31,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:19:31,844 INFO L87 Difference]: Start difference. First operand 1555 states and 2006 transitions. Second operand has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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:19:32,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:19:32,792 INFO L93 Difference]: Finished difference Result 1555 states and 2004 transitions. [2025-01-10 00:19:32,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:19:32,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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 85 [2025-01-10 00:19:32,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:19:32,795 INFO L225 Difference]: With dead ends: 1555 [2025-01-10 00:19:32,795 INFO L226 Difference]: Without dead ends: 1555 [2025-01-10 00:19:32,796 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:19:32,796 INFO L435 NwaCegarLoop]: 1222 mSDtfsCounter, 1 mSDsluCounter, 3246 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4468 SdHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:19:32,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4468 Invalid, 1668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1663 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-10 00:19:32,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2025-01-10 00:19:32,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1555. [2025-01-10 00:19:32,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1169 states have (on average 1.6911890504704876) internal successors, (1977), 1542 states have internal predecessors, (1977), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2025-01-10 00:19:32,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2004 transitions. [2025-01-10 00:19:32,811 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2004 transitions. Word has length 85 [2025-01-10 00:19:32,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:19:32,811 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2004 transitions. [2025-01-10 00:19:32,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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:19:32,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2004 transitions. [2025-01-10 00:19:32,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-10 00:19:32,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:19:32,811 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] [2025-01-10 00:19:32,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:19:32,812 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:19:32,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:19:32,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1541684379, now seen corresponding path program 1 times [2025-01-10 00:19:32,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:19:32,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683209658] [2025-01-10 00:19:32,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:32,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:19:32,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-10 00:19:32,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-10 00:19:32,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:32,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:33,133 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:19:33,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:19:33,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683209658] [2025-01-10 00:19:33,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683209658] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:19:33,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910287369] [2025-01-10 00:19:33,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:33,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:19:33,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:19:33,136 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:19:33,137 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:19:33,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-10 00:19:33,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-10 00:19:33,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:33,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:33,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 00:19:33,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:19:33,316 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:19:33,397 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:19:33,397 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:19:33,405 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:19:33,451 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:19:33,451 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:19:33,474 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:19:33,476 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:19:33,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:19:33,520 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-01-10 00:19:33,521 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:19:33,530 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_501) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2025-01-10 00:19:33,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910287369] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:19:33,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:19:33,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2025-01-10 00:19:33,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344809040] [2025-01-10 00:19:33,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:19:33,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:19:33,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:19:33,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:19:33,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2025-01-10 00:19:33,538 INFO L87 Difference]: Start difference. First operand 1555 states and 2004 transitions. Second operand has 14 states, 12 states have (on average 10.166666666666666) internal successors, (122), 13 states have internal predecessors, (122), 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:19:35,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:19:35,436 INFO L93 Difference]: Finished difference Result 1554 states and 2002 transitions. [2025-01-10 00:19:35,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:19:35,437 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.166666666666666) internal successors, (122), 13 states have internal predecessors, (122), 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 86 [2025-01-10 00:19:35,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:19:35,440 INFO L225 Difference]: With dead ends: 1554 [2025-01-10 00:19:35,440 INFO L226 Difference]: Without dead ends: 1554 [2025-01-10 00:19:35,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=342, Unknown=1, NotChecked=38, Total=462 [2025-01-10 00:19:35,440 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 1148 mSDsluCounter, 5751 mSDsCounter, 0 mSdLazyCounter, 4512 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 6493 SdHoareTripleChecker+Invalid, 4533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:19:35,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 6493 Invalid, 4533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4512 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-10 00:19:35,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2025-01-10 00:19:35,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1554. [2025-01-10 00:19:35,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1169 states have (on average 1.6894781864841746) internal successors, (1975), 1541 states have internal predecessors, (1975), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2025-01-10 00:19:35,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2002 transitions. [2025-01-10 00:19:35,459 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2002 transitions. Word has length 86 [2025-01-10 00:19:35,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:19:35,459 INFO L471 AbstractCegarLoop]: Abstraction has 1554 states and 2002 transitions. [2025-01-10 00:19:35,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.166666666666666) internal successors, (122), 13 states have internal predecessors, (122), 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:19:35,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2002 transitions. [2025-01-10 00:19:35,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-10 00:19:35,460 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:19:35,460 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] [2025-01-10 00:19:35,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 00:19:35,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 00:19:35,665 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:19:35,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:19:35,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1541684378, now seen corresponding path program 1 times [2025-01-10 00:19:35,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:19:35,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906744569] [2025-01-10 00:19:35,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:35,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:19:35,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-10 00:19:35,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-10 00:19:35,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:35,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:36,146 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:19:36,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:19:36,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906744569] [2025-01-10 00:19:36,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906744569] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:19:36,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53030592] [2025-01-10 00:19:36,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:36,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:19:36,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:19:36,150 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:19:36,155 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:19:36,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-10 00:19:36,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-10 00:19:36,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:36,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:36,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 00:19:36,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:19:36,317 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:19:36,403 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:19:36,404 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:19:36,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:19:36,426 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:19:36,562 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:19:36,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2025-01-10 00:19:36,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2025-01-10 00:19:36,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2025-01-10 00:19:36,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2025-01-10 00:19:36,628 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:19:36,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:19:36,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:19:36,727 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 48 treesize of output 52 [2025-01-10 00:19:36,760 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_1 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_1) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_629 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_ArrVal_630 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_#t~mem50#1.offset| 25))))) is different from false [2025-01-10 00:19:36,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53030592] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:19:36,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:19:36,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2025-01-10 00:19:36,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36183950] [2025-01-10 00:19:36,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:19:36,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 00:19:36,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:19:36,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 00:19:36,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=361, Unknown=1, NotChecked=38, Total=462 [2025-01-10 00:19:36,763 INFO L87 Difference]: Start difference. First operand 1554 states and 2002 transitions. Second operand has 19 states, 16 states have (on average 8.375) internal successors, (134), 19 states have internal predecessors, (134), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:19:39,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:19:39,648 INFO L93 Difference]: Finished difference Result 1553 states and 2000 transitions. [2025-01-10 00:19:39,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:19:39,648 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.375) internal successors, (134), 19 states have internal predecessors, (134), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 86 [2025-01-10 00:19:39,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:19:39,655 INFO L225 Difference]: With dead ends: 1553 [2025-01-10 00:19:39,655 INFO L226 Difference]: Without dead ends: 1553 [2025-01-10 00:19:39,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=505, Unknown=1, NotChecked=46, Total=650 [2025-01-10 00:19:39,656 INFO L435 NwaCegarLoop]: 741 mSDtfsCounter, 1141 mSDsluCounter, 6519 mSDsCounter, 0 mSdLazyCounter, 6211 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 7260 SdHoareTripleChecker+Invalid, 6236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 6211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:19:39,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 7260 Invalid, 6236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 6211 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-10 00:19:39,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2025-01-10 00:19:39,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 1544. [2025-01-10 00:19:39,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1161 states have (on average 1.6916451335055986) internal successors, (1964), 1533 states have internal predecessors, (1964), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 00:19:39,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1982 transitions. [2025-01-10 00:19:39,679 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1982 transitions. Word has length 86 [2025-01-10 00:19:39,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:19:39,679 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 1982 transitions. [2025-01-10 00:19:39,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.375) internal successors, (134), 19 states have internal predecessors, (134), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:19:39,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1982 transitions. [2025-01-10 00:19:39,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-10 00:19:39,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:19:39,680 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:19:39,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 00:19:39,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 00:19:39,881 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:19:39,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:19:39,882 INFO L85 PathProgramCache]: Analyzing trace with hash 405726359, now seen corresponding path program 1 times [2025-01-10 00:19:39,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:19:39,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904749912] [2025-01-10 00:19:39,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:39,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:19:39,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-10 00:19:39,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 00:19:39,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:39,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:40,216 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:19:40,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:19:40,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904749912] [2025-01-10 00:19:40,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904749912] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:19:40,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:19:40,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-10 00:19:40,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538389697] [2025-01-10 00:19:40,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:19:40,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:19:40,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:19:40,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:19:40,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:19:40,218 INFO L87 Difference]: Start difference. First operand 1544 states and 1982 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 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:19:42,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:19:42,308 INFO L93 Difference]: Finished difference Result 1560 states and 2008 transitions. [2025-01-10 00:19:42,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:19:42,309 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 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:19:42,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:19:42,313 INFO L225 Difference]: With dead ends: 1560 [2025-01-10 00:19:42,313 INFO L226 Difference]: Without dead ends: 1560 [2025-01-10 00:19:42,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-01-10 00:19:42,314 INFO L435 NwaCegarLoop]: 741 mSDtfsCounter, 1166 mSDsluCounter, 6497 mSDsCounter, 0 mSdLazyCounter, 5032 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 7238 SdHoareTripleChecker+Invalid, 5052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:19:42,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 7238 Invalid, 5052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 5032 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-10 00:19:42,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2025-01-10 00:19:42,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1559. [2025-01-10 00:19:42,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1175 states have (on average 1.6859574468085106) internal successors, (1981), 1546 states have internal predecessors, (1981), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2025-01-10 00:19:42,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2008 transitions. [2025-01-10 00:19:42,327 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2008 transitions. Word has length 88 [2025-01-10 00:19:42,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:19:42,327 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2008 transitions. [2025-01-10 00:19:42,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 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:19:42,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2008 transitions. [2025-01-10 00:19:42,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-10 00:19:42,328 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:19:42,328 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:19:42,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 00:19:42,328 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:19:42,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:19:42,328 INFO L85 PathProgramCache]: Analyzing trace with hash 405726360, now seen corresponding path program 1 times [2025-01-10 00:19:42,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:19:42,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587246229] [2025-01-10 00:19:42,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:42,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:19:42,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-10 00:19:42,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 00:19:42,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:42,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:42,767 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:19:42,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:19:42,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587246229] [2025-01-10 00:19:42,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587246229] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:19:42,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:19:42,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:19:42,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620093101] [2025-01-10 00:19:42,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:19:42,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:19:42,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:19:42,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:19:42,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:19:42,768 INFO L87 Difference]: Start difference. First operand 1559 states and 2008 transitions. Second operand has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 states have internal predecessors, (86), 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:19:45,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:19:45,071 INFO L93 Difference]: Finished difference Result 1559 states and 2006 transitions. [2025-01-10 00:19:45,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:19:45,071 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 states have internal predecessors, (86), 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:19:45,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:19:45,074 INFO L225 Difference]: With dead ends: 1559 [2025-01-10 00:19:45,074 INFO L226 Difference]: Without dead ends: 1559 [2025-01-10 00:19:45,074 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:19:45,075 INFO L435 NwaCegarLoop]: 748 mSDtfsCounter, 1147 mSDsluCounter, 4321 mSDsCounter, 0 mSdLazyCounter, 4716 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 5069 SdHoareTripleChecker+Invalid, 4735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:19:45,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 5069 Invalid, 4735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4716 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-10 00:19:45,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2025-01-10 00:19:45,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1559. [2025-01-10 00:19:45,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1175 states have (on average 1.6842553191489362) internal successors, (1979), 1546 states have internal predecessors, (1979), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2025-01-10 00:19:45,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2006 transitions. [2025-01-10 00:19:45,085 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2006 transitions. Word has length 88 [2025-01-10 00:19:45,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:19:45,086 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2006 transitions. [2025-01-10 00:19:45,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 states have internal predecessors, (86), 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:19:45,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2006 transitions. [2025-01-10 00:19:45,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-10 00:19:45,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:19:45,086 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:19:45,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 00:19:45,086 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:19:45,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:19:45,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2061532414, now seen corresponding path program 1 times [2025-01-10 00:19:45,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:19:45,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184608272] [2025-01-10 00:19:45,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:45,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:19:45,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-10 00:19:45,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-10 00:19:45,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:45,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:45,424 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:19:45,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:19:45,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184608272] [2025-01-10 00:19:45,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184608272] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:19:45,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323876428] [2025-01-10 00:19:45,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:45,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:19:45,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:19:45,427 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:19:45,429 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:19:45,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-10 00:19:45,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-10 00:19:45,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:45,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:45,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 00:19:45,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:19:45,606 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:19:45,686 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:19:45,687 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:19:45,692 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:19:45,733 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:19:45,733 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:19:45,767 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:19:45,767 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:19:45,776 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:19:45,778 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:19:45,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:19:45,850 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-01-10 00:19:45,850 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:19:45,854 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_879 (Array Int Int)) (v_ArrVal_882 (Array Int Int))) (= (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_882))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_879)) |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:19:45,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323876428] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:19:45,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:19:45,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2025-01-10 00:19:45,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734688150] [2025-01-10 00:19:45,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:19:45,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 00:19:45,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:19:45,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 00:19:45,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=245, Unknown=14, NotChecked=32, Total=342 [2025-01-10 00:19:45,857 INFO L87 Difference]: Start difference. First operand 1559 states and 2006 transitions. Second operand has 16 states, 14 states have (on average 9.071428571428571) internal successors, (127), 15 states have internal predecessors, (127), 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:19:47,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:19:47,590 INFO L93 Difference]: Finished difference Result 1558 states and 2004 transitions. [2025-01-10 00:19:47,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:19:47,591 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.071428571428571) internal successors, (127), 15 states have internal predecessors, (127), 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 89 [2025-01-10 00:19:47,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:19:47,594 INFO L225 Difference]: With dead ends: 1558 [2025-01-10 00:19:47,594 INFO L226 Difference]: Without dead ends: 1558 [2025-01-10 00:19:47,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=483, Unknown=15, NotChecked=46, Total=650 [2025-01-10 00:19:47,594 INFO L435 NwaCegarLoop]: 741 mSDtfsCounter, 1142 mSDsluCounter, 5052 mSDsCounter, 0 mSdLazyCounter, 4004 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 5793 SdHoareTripleChecker+Invalid, 4024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:19:47,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 5793 Invalid, 4024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4004 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-10 00:19:47,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2025-01-10 00:19:47,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1558. [2025-01-10 00:19:47,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1175 states have (on average 1.6825531914893617) internal successors, (1977), 1545 states have internal predecessors, (1977), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2025-01-10 00:19:47,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2004 transitions. [2025-01-10 00:19:47,607 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2004 transitions. Word has length 89 [2025-01-10 00:19:47,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:19:47,607 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 2004 transitions. [2025-01-10 00:19:47,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.071428571428571) internal successors, (127), 15 states have internal predecessors, (127), 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:19:47,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2004 transitions. [2025-01-10 00:19:47,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-10 00:19:47,608 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:19:47,608 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] [2025-01-10 00:19:47,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 00:19:47,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:19:47,809 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:19:47,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:19:47,809 INFO L85 PathProgramCache]: Analyzing trace with hash 2061532415, now seen corresponding path program 1 times [2025-01-10 00:19:47,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:19:47,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454857329] [2025-01-10 00:19:47,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:47,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:19:47,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-10 00:19:47,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-10 00:19:47,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:47,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:48,254 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:19:48,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:19:48,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454857329] [2025-01-10 00:19:48,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454857329] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:19:48,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884270452] [2025-01-10 00:19:48,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:48,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:19:48,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:19:48,257 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:19:48,265 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:19:48,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-10 00:19:48,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-10 00:19:48,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:48,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:48,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-10 00:19:48,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:19:48,435 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:19:48,569 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:19:48,569 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:19:48,573 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:19:48,590 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:19:48,592 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:19:48,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-10 00:19:48,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-10 00:19:48,741 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:19:48,741 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:19:48,746 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:19:48,807 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:19:48,808 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:19:48,811 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:19:48,824 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:19:48,827 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:19:48,843 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:19:48,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:19:48,890 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1019 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1019) |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_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-01-10 00:19:48,898 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_1019 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-01-10 00:19:48,933 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1026))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1025) .cse0 v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1025) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1026) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2025-01-10 00:19:48,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884270452] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:19:48,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:19:48,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-01-10 00:19:48,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815065108] [2025-01-10 00:19:48,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:19:48,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 00:19:48,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:19:48,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 00:19:48,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=397, Unknown=3, NotChecked=126, Total=600 [2025-01-10 00:19:48,936 INFO L87 Difference]: Start difference. First operand 1558 states and 2004 transitions. Second operand has 20 states, 17 states have (on average 8.235294117647058) internal successors, (140), 20 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:19:52,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:19:52,384 INFO L93 Difference]: Finished difference Result 1565 states and 2010 transitions. [2025-01-10 00:19:52,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:19:52,384 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.235294117647058) internal successors, (140), 20 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 89 [2025-01-10 00:19:52,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:19:52,387 INFO L225 Difference]: With dead ends: 1565 [2025-01-10 00:19:52,387 INFO L226 Difference]: Without dead ends: 1565 [2025-01-10 00:19:52,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=594, Unknown=3, NotChecked=156, Total=870 [2025-01-10 00:19:52,388 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 1138 mSDsluCounter, 5815 mSDsCounter, 0 mSdLazyCounter, 6928 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 6561 SdHoareTripleChecker+Invalid, 6956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 6928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:19:52,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 6561 Invalid, 6956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 6928 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-01-10 00:19:52,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2025-01-10 00:19:52,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1547. [2025-01-10 00:19:52,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1165 states have (on average 1.6866952789699572) internal successors, (1965), 1535 states have internal predecessors, (1965), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 00:19:52,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 1983 transitions. [2025-01-10 00:19:52,405 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 1983 transitions. Word has length 89 [2025-01-10 00:19:52,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:19:52,405 INFO L471 AbstractCegarLoop]: Abstraction has 1547 states and 1983 transitions. [2025-01-10 00:19:52,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.235294117647058) internal successors, (140), 20 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:19:52,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 1983 transitions. [2025-01-10 00:19:52,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-10 00:19:52,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:19:52,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:52,414 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:19:52,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-10 00:19:52,608 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:19:52,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:19:52,608 INFO L85 PathProgramCache]: Analyzing trace with hash 956600755, now seen corresponding path program 1 times [2025-01-10 00:19:52,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:19:52,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754958136] [2025-01-10 00:19:52,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:52,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:19:52,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 00:19:52,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 00:19:52,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:52,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:52,945 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:19:52,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:19:52,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754958136] [2025-01-10 00:19:52,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754958136] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:19:52,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:19:52,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-10 00:19:52,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258671087] [2025-01-10 00:19:52,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:19:52,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 00:19:52,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:19:52,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 00:19:52,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-01-10 00:19:52,947 INFO L87 Difference]: Start difference. First operand 1547 states and 1983 transitions. Second operand has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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:19:55,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:19:55,423 INFO L93 Difference]: Finished difference Result 1572 states and 2018 transitions. [2025-01-10 00:19:55,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:19:55,423 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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 91 [2025-01-10 00:19:55,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:19:55,425 INFO L225 Difference]: With dead ends: 1572 [2025-01-10 00:19:55,425 INFO L226 Difference]: Without dead ends: 1572 [2025-01-10 00:19:55,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-01-10 00:19:55,427 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 1171 mSDsluCounter, 7899 mSDsCounter, 0 mSdLazyCounter, 6003 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 8639 SdHoareTripleChecker+Invalid, 6024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 6003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:19:55,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 8639 Invalid, 6024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 6003 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-10 00:19:55,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2025-01-10 00:19:55,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1568. [2025-01-10 00:19:55,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1185 states have (on average 1.6776371308016877) internal successors, (1988), 1554 states have internal predecessors, (1988), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2025-01-10 00:19:55,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2008 transitions. [2025-01-10 00:19:55,460 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2008 transitions. Word has length 91 [2025-01-10 00:19:55,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:19:55,460 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2008 transitions. [2025-01-10 00:19:55,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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:19:55,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2008 transitions. [2025-01-10 00:19:55,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-10 00:19:55,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:19:55,461 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:19:55,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 00:19:55,461 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:19:55,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:19:55,462 INFO L85 PathProgramCache]: Analyzing trace with hash 956600756, now seen corresponding path program 1 times [2025-01-10 00:19:55,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:19:55,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533414441] [2025-01-10 00:19:55,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:55,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:19:55,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 00:19:55,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 00:19:55,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:55,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:55,899 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:19:55,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:19:55,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533414441] [2025-01-10 00:19:55,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533414441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:19:55,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:19:55,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 00:19:55,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145902802] [2025-01-10 00:19:55,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:19:55,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 00:19:55,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:19:55,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 00:19:55,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-10 00:19:55,901 INFO L87 Difference]: Start difference. First operand 1568 states and 2008 transitions. Second operand has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 12 states have internal predecessors, (89), 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:19:58,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:19:58,212 INFO L93 Difference]: Finished difference Result 1571 states and 2016 transitions. [2025-01-10 00:19:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:19:58,213 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 12 states have internal predecessors, (89), 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 91 [2025-01-10 00:19:58,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:19:58,215 INFO L225 Difference]: With dead ends: 1571 [2025-01-10 00:19:58,215 INFO L226 Difference]: Without dead ends: 1571 [2025-01-10 00:19:58,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-01-10 00:19:58,215 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 1148 mSDsluCounter, 4168 mSDsCounter, 0 mSdLazyCounter, 4886 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 4915 SdHoareTripleChecker+Invalid, 4905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:19:58,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 4915 Invalid, 4905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4886 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-10 00:19:58,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2025-01-10 00:19:58,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1568. [2025-01-10 00:19:58,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1185 states have (on average 1.6759493670886076) internal successors, (1986), 1554 states have internal predecessors, (1986), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2025-01-10 00:19:58,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2006 transitions. [2025-01-10 00:19:58,229 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2006 transitions. Word has length 91 [2025-01-10 00:19:58,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:19:58,229 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2006 transitions. [2025-01-10 00:19:58,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 12 states have internal predecessors, (89), 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:19:58,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2006 transitions. [2025-01-10 00:19:58,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-10 00:19:58,230 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:19:58,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:19:58,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 00:19:58,230 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:19:58,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:19:58,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1375390700, now seen corresponding path program 1 times [2025-01-10 00:19:58,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:19:58,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923677117] [2025-01-10 00:19:58,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:58,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:19:58,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-10 00:19:58,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 00:19:58,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:58,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:58,593 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:19:58,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:19:58,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923677117] [2025-01-10 00:19:58,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923677117] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:19:58,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266487589] [2025-01-10 00:19:58,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:19:58,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:19:58,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:19:58,595 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:19:58,597 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:19:58,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-10 00:19:58,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 00:19:58,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:19:58,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:19:58,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-10 00:19:58,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:19:58,778 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:19:58,850 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:19:58,850 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:19:58,857 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:19:58,894 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:19:58,894 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:19:58,929 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:19:58,929 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:19:58,967 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:19:58,967 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:19:58,998 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:19:59,001 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:19:59,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:19:59,012 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1300) |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:19:59,042 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (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~mem52#1.base| v_ArrVal_1299))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1300)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:19:59,094 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2025-01-10 00:19:59,095 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:19:59,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266487589] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:19:59,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:19:59,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 17 [2025-01-10 00:19:59,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65540320] [2025-01-10 00:19:59,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:19:59,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 00:19:59,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:19:59,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 00:19:59,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=335, Unknown=22, NotChecked=78, Total=506 [2025-01-10 00:19:59,126 INFO L87 Difference]: Start difference. First operand 1568 states and 2006 transitions. Second operand has 18 states, 16 states have (on average 8.25) internal successors, (132), 17 states have internal predecessors, (132), 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:20:01,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:20:01,230 INFO L93 Difference]: Finished difference Result 1570 states and 2014 transitions. [2025-01-10 00:20:01,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 00:20:01,230 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.25) internal successors, (132), 17 states have internal predecessors, (132), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2025-01-10 00:20:01,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:20:01,232 INFO L225 Difference]: With dead ends: 1570 [2025-01-10 00:20:01,232 INFO L226 Difference]: Without dead ends: 1570 [2025-01-10 00:20:01,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=655, Unknown=22, NotChecked=110, Total=930 [2025-01-10 00:20:01,237 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 1140 mSDsluCounter, 6459 mSDsCounter, 0 mSdLazyCounter, 4978 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 7199 SdHoareTripleChecker+Invalid, 4998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:20:01,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 7199 Invalid, 4998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4978 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-10 00:20:01,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2025-01-10 00:20:01,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1567. [2025-01-10 00:20:01,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1185 states have (on average 1.6742616033755273) internal successors, (1984), 1553 states have internal predecessors, (1984), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2025-01-10 00:20:01,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2004 transitions. [2025-01-10 00:20:01,261 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2004 transitions. Word has length 92 [2025-01-10 00:20:01,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:20:01,261 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2004 transitions. [2025-01-10 00:20:01,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.25) internal successors, (132), 17 states have internal predecessors, (132), 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:20:01,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2004 transitions. [2025-01-10 00:20:01,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-10 00:20:01,262 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:20:01,262 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:20:01,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 00:20:01,463 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,SelfDestructingSolverStorable23 [2025-01-10 00:20:01,464 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:20:01,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:20:01,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1375390701, now seen corresponding path program 1 times [2025-01-10 00:20:01,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:20:01,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691586562] [2025-01-10 00:20:01,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:20:01,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:20:01,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-10 00:20:01,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 00:20:01,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:20:01,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:20:02,073 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:20:02,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:20:02,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691586562] [2025-01-10 00:20:02,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691586562] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:20:02,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762618669] [2025-01-10 00:20:02,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:20:02,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:20:02,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:20:02,077 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:20:02,078 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:20:02,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-10 00:20:02,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 00:20:02,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:20:02,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:20:02,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-10 00:20:02,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:20:02,329 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:20:02,469 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:20:02,481 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:20:02,482 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:20:02,495 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:20:02,498 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:20:02,556 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:20:02,559 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:20:02,721 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:20:02,721 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:20:02,726 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:20:02,779 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:20:02,779 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:20:02,792 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:20:02,857 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:20:02,858 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:20:02,861 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:20:02,879 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:20:02,883 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:20:02,884 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:20:02,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:20:02,939 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-01-10 00:20:02,948 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_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1454 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) is different from false [2025-01-10 00:20:02,965 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1453) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1452))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1453) .cse1 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-01-10 00:20:02,992 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1452))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1453) .cse1 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1453) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))) is different from false [2025-01-10 00:20:03,059 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1460))) (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_1461) .cse0 v_ArrVal_1453) (select (select (store .cse1 .cse0 v_ArrVal_1452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1454))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1460))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1452))) (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_1461) .cse3 v_ArrVal_1453) .cse4 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2025-01-10 00:20:03,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762618669] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:20:03,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:20:03,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 17 [2025-01-10 00:20:03,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030149870] [2025-01-10 00:20:03,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:20:03,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 00:20:03,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:20:03,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 00:20:03,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=321, Unknown=5, NotChecked=200, Total=600 [2025-01-10 00:20:03,062 INFO L87 Difference]: Start difference. First operand 1567 states and 2004 transitions. Second operand has 18 states, 16 states have (on average 8.5625) internal successors, (137), 18 states have internal predecessors, (137), 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:20:07,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:20:07,443 INFO L93 Difference]: Finished difference Result 1569 states and 2012 transitions. [2025-01-10 00:20:07,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:20:07,444 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.5625) internal successors, (137), 18 states have internal predecessors, (137), 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 92 [2025-01-10 00:20:07,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:20:07,446 INFO L225 Difference]: With dead ends: 1569 [2025-01-10 00:20:07,446 INFO L226 Difference]: Without dead ends: 1569 [2025-01-10 00:20:07,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=546, Unknown=5, NotChecked=260, Total=930 [2025-01-10 00:20:07,447 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 1134 mSDsluCounter, 7570 mSDsCounter, 0 mSdLazyCounter, 8748 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 8315 SdHoareTripleChecker+Invalid, 8774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 8748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:20:07,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 8315 Invalid, 8774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 8748 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-01-10 00:20:07,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2025-01-10 00:20:07,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1545. [2025-01-10 00:20:07,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1165 states have (on average 1.6832618025751074) internal successors, (1961), 1533 states have internal predecessors, (1961), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 00:20:07,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1979 transitions. [2025-01-10 00:20:07,457 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1979 transitions. Word has length 92 [2025-01-10 00:20:07,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:20:07,457 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 1979 transitions. [2025-01-10 00:20:07,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.5625) internal successors, (137), 18 states have internal predecessors, (137), 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:20:07,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1979 transitions. [2025-01-10 00:20:07,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-10 00:20:07,460 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:20:07,460 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:20:07,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 00:20:07,664 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,SelfDestructingSolverStorable24 [2025-01-10 00:20:07,664 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:20:07,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:20:07,664 INFO L85 PathProgramCache]: Analyzing trace with hash 985700926, now seen corresponding path program 1 times [2025-01-10 00:20:07,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:20:07,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882066011] [2025-01-10 00:20:07,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:20:07,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:20:07,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 00:20:07,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 00:20:07,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:20:07,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:20:08,147 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:20:08,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:20:08,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882066011] [2025-01-10 00:20:08,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882066011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:20:08,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:20:08,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-10 00:20:08,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115501575] [2025-01-10 00:20:08,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:20:08,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 00:20:08,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:20:08,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 00:20:08,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-01-10 00:20:08,149 INFO L87 Difference]: Start difference. First operand 1545 states and 1979 transitions. Second operand has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 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:20:10,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:20:10,426 INFO L93 Difference]: Finished difference Result 1576 states and 2020 transitions. [2025-01-10 00:20:10,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 00:20:10,426 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 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 94 [2025-01-10 00:20:10,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:20:10,428 INFO L225 Difference]: With dead ends: 1576 [2025-01-10 00:20:10,428 INFO L226 Difference]: Without dead ends: 1576 [2025-01-10 00:20:10,428 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:20:10,429 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 1157 mSDsluCounter, 8605 mSDsCounter, 0 mSdLazyCounter, 6521 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 9344 SdHoareTripleChecker+Invalid, 6542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 6521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:20:10,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 9344 Invalid, 6542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 6521 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-10 00:20:10,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2025-01-10 00:20:10,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1572. [2025-01-10 00:20:10,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1191 states have (on average 1.670864819479429) internal successors, (1990), 1558 states have internal predecessors, (1990), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2025-01-10 00:20:10,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2010 transitions. [2025-01-10 00:20:10,444 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2010 transitions. Word has length 94 [2025-01-10 00:20:10,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:20:10,444 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2010 transitions. [2025-01-10 00:20:10,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 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:20:10,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2010 transitions. [2025-01-10 00:20:10,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-10 00:20:10,446 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:20:10,446 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:20:10,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 00:20:10,446 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:20:10,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:20:10,446 INFO L85 PathProgramCache]: Analyzing trace with hash 985700927, now seen corresponding path program 1 times [2025-01-10 00:20:10,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:20:10,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304899899] [2025-01-10 00:20:10,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:20:10,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:20:10,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 00:20:10,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 00:20:10,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:20:10,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:20:10,979 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:20:10,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:20:10,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304899899] [2025-01-10 00:20:10,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304899899] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:20:10,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:20:10,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-10 00:20:10,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720289005] [2025-01-10 00:20:10,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:20:10,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:20:10,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:20:10,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:20:10,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:20:10,980 INFO L87 Difference]: Start difference. First operand 1572 states and 2010 transitions. Second operand has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 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:20:13,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:20:13,149 INFO L93 Difference]: Finished difference Result 1575 states and 2018 transitions. [2025-01-10 00:20:13,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:20:13,150 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 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 94 [2025-01-10 00:20:13,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:20:13,152 INFO L225 Difference]: With dead ends: 1575 [2025-01-10 00:20:13,152 INFO L226 Difference]: Without dead ends: 1575 [2025-01-10 00:20:13,152 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:20:13,153 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 1166 mSDsluCounter, 4172 mSDsCounter, 0 mSdLazyCounter, 4886 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 4918 SdHoareTripleChecker+Invalid, 4905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:20:13,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 4918 Invalid, 4905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4886 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-10 00:20:13,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2025-01-10 00:20:13,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1572. [2025-01-10 00:20:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1191 states have (on average 1.669185558354324) internal successors, (1988), 1558 states have internal predecessors, (1988), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2025-01-10 00:20:13,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2008 transitions. [2025-01-10 00:20:13,164 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2008 transitions. Word has length 94 [2025-01-10 00:20:13,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:20:13,164 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2008 transitions. [2025-01-10 00:20:13,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 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:20:13,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2008 transitions. [2025-01-10 00:20:13,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-10 00:20:13,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:20:13,165 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:20:13,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-10 00:20:13,165 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:20:13,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:20:13,165 INFO L85 PathProgramCache]: Analyzing trace with hash 276957541, now seen corresponding path program 1 times [2025-01-10 00:20:13,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:20:13,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939833482] [2025-01-10 00:20:13,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:20:13,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:20:13,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 00:20:13,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 00:20:13,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:20:13,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:20:13,562 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:20:13,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:20:13,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939833482] [2025-01-10 00:20:13,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939833482] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:20:13,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533309360] [2025-01-10 00:20:13,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:20:13,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:20:13,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:20:13,566 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:20:13,567 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:20:13,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 00:20:13,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 00:20:13,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:20:13,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:20:13,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-10 00:20:13,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:20:13,769 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:20:13,832 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:20:13,832 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:20:13,837 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:20:13,899 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:20:13,899 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:20:13,930 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:20:13,930 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:20:13,962 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:20:13,962 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:20:13,995 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:20:13,995 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:20:14,002 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:20:14,003 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:20:14,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:20:14,031 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1760 (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_1760) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-01-10 00:20:14,037 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (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_1759))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:20:14,066 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1758))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:20:14,123 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2025-01-10 00:20:14,123 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:20:14,128 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1763 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1763))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1758)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2025-01-10 00:20:14,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533309360] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:20:14,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:20:14,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 21 [2025-01-10 00:20:14,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941676310] [2025-01-10 00:20:14,129 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:20:14,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 00:20:14,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:20:14,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 00:20:14,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=494, Unknown=26, NotChecked=196, Total=812 [2025-01-10 00:20:14,130 INFO L87 Difference]: Start difference. First operand 1572 states and 2008 transitions. Second operand has 22 states, 19 states have (on average 7.578947368421052) internal successors, (144), 22 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:20:16,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:20:16,964 INFO L93 Difference]: Finished difference Result 1574 states and 2016 transitions. [2025-01-10 00:20:16,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 00:20:16,965 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.578947368421052) internal successors, (144), 22 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2025-01-10 00:20:16,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:20:16,967 INFO L225 Difference]: With dead ends: 1574 [2025-01-10 00:20:16,967 INFO L226 Difference]: Without dead ends: 1574 [2025-01-10 00:20:16,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=931, Unknown=26, NotChecked=268, Total=1406 [2025-01-10 00:20:16,968 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 1134 mSDsluCounter, 9335 mSDsCounter, 0 mSdLazyCounter, 7010 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 10074 SdHoareTripleChecker+Invalid, 7030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 7010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:20:16,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 10074 Invalid, 7030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 7010 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-10 00:20:16,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2025-01-10 00:20:16,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1571. [2025-01-10 00:20:16,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1191 states have (on average 1.6675062972292192) internal successors, (1986), 1557 states have internal predecessors, (1986), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2025-01-10 00:20:16,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2006 transitions. [2025-01-10 00:20:16,981 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2006 transitions. Word has length 95 [2025-01-10 00:20:16,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:20:16,982 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 2006 transitions. [2025-01-10 00:20:16,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.578947368421052) internal successors, (144), 22 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:20:16,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2006 transitions. [2025-01-10 00:20:16,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-10 00:20:16,982 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:20:16,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:20:16,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 00:20:17,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:20:17,183 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:20:17,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:20:17,184 INFO L85 PathProgramCache]: Analyzing trace with hash 276957542, now seen corresponding path program 1 times [2025-01-10 00:20:17,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:20:17,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357859880] [2025-01-10 00:20:17,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:20:17,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:20:17,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 00:20:17,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 00:20:17,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:20:17,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:20:17,742 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:20:17,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:20:17,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357859880] [2025-01-10 00:20:17,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357859880] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:20:17,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818099936] [2025-01-10 00:20:17,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:20:17,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:20:17,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:20:17,746 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:20:17,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 00:20:17,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 00:20:17,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 00:20:17,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:20:17,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:20:17,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-01-10 00:20:17,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:20:17,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:20:18,012 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:20:18,017 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:20:18,018 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:20:18,023 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:20:18,026 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:20:18,059 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:20:18,061 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:20:18,131 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:20:18,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 62 treesize of output 57 [2025-01-10 00:20:18,134 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:20:18,182 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:20:18,183 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:20:18,187 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:20:18,225 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:20:18,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:20:18,228 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:20:18,268 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:20:18,268 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:20:18,271 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:20:18,282 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:20:18,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-10 00:20:18,288 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:20:18,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:20:18,329 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-01-10 00:20:18,375 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1926))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1927) .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1927) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2025-01-10 00:20:18,383 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1926))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1927) .cse1 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1927) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2025-01-10 00:20:18,398 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1925))) (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~mem52#1.base| v_ArrVal_1924) .cse0 v_ArrVal_1927) (select (select (store .cse1 .cse0 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1929))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1925))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1926))) (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~mem52#1.base| v_ArrVal_1924) .cse3 v_ArrVal_1927) .cse4 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2025-01-10 00:20:18,410 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1925))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1924) .cse1 v_ArrVal_1927) (select (select (store .cse2 .cse1 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1929))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1925))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_1926))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1924) .cse4 v_ArrVal_1927) .cse5 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2025-01-10 00:20:18,466 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1935 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1934))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1925))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1935) .cse0 v_ArrVal_1924) .cse1 v_ArrVal_1927) (select (select (store .cse2 .cse1 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1929))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1935 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1934))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1925))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1926))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1935) .cse5 v_ArrVal_1924) .cse6 v_ArrVal_1927) .cse7 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2025-01-10 00:20:18,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818099936] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:20:18,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:20:18,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 19 [2025-01-10 00:20:18,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761535500] [2025-01-10 00:20:18,469 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:20:18,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 00:20:18,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:20:18,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 00:20:18,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=420, Unknown=14, NotChecked=282, Total=812 [2025-01-10 00:20:18,470 INFO L87 Difference]: Start difference. First operand 1571 states and 2006 transitions. Second operand has 20 states, 18 states have (on average 7.888888888888889) internal successors, (142), 20 states have internal predecessors, (142), 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:20:21,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:20:21,153 INFO L93 Difference]: Finished difference Result 1573 states and 2014 transitions. [2025-01-10 00:20:21,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 00:20:21,154 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.888888888888889) internal successors, (142), 20 states have internal predecessors, (142), 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 95 [2025-01-10 00:20:21,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:20:21,156 INFO L225 Difference]: With dead ends: 1573 [2025-01-10 00:20:21,156 INFO L226 Difference]: Without dead ends: 1573 [2025-01-10 00:20:21,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=724, Unknown=14, NotChecked=366, Total=1260 [2025-01-10 00:20:21,157 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 1135 mSDsluCounter, 5070 mSDsCounter, 0 mSdLazyCounter, 5226 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 5814 SdHoareTripleChecker+Invalid, 5247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 5226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:20:21,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 5814 Invalid, 5247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 5226 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-10 00:20:21,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2025-01-10 00:20:21,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1543. [2025-01-10 00:20:21,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1165 states have (on average 1.6798283261802576) internal successors, (1957), 1531 states have internal predecessors, (1957), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 00:20:21,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 1975 transitions. [2025-01-10 00:20:21,176 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 1975 transitions. Word has length 95 [2025-01-10 00:20:21,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:20:21,177 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 1975 transitions. [2025-01-10 00:20:21,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.888888888888889) internal successors, (142), 20 states have internal predecessors, (142), 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:20:21,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 1975 transitions. [2025-01-10 00:20:21,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-10 00:20:21,178 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:20:21,178 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:20:21,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 00:20:21,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-10 00:20:21,382 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:20:21,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:20:21,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1500824768, now seen corresponding path program 1 times [2025-01-10 00:20:21,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:20:21,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965339693] [2025-01-10 00:20:21,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:20:21,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:20:21,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 00:20:21,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 00:20:21,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:20:21,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:20:21,919 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:20:21,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:20:21,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965339693] [2025-01-10 00:20:21,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965339693] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:20:21,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:20:21,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-10 00:20:21,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870417916] [2025-01-10 00:20:21,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:20:21,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:20:21,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:20:21,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:20:21,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:20:21,921 INFO L87 Difference]: Start difference. First operand 1543 states and 1975 transitions. Second operand has 14 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:20:23,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:20:23,960 INFO L93 Difference]: Finished difference Result 1582 states and 2024 transitions. [2025-01-10 00:20:23,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:20:23,960 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2025-01-10 00:20:23,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:20:23,961 INFO L225 Difference]: With dead ends: 1582 [2025-01-10 00:20:23,961 INFO L226 Difference]: Without dead ends: 1582 [2025-01-10 00:20:23,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2025-01-10 00:20:23,962 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 1169 mSDsluCounter, 6433 mSDsCounter, 0 mSdLazyCounter, 5008 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 7177 SdHoareTripleChecker+Invalid, 5029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 5008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:20:23,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1179 Valid, 7177 Invalid, 5029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 5008 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-10 00:20:23,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2025-01-10 00:20:23,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1578. [2025-01-10 00:20:23,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1199 states have (on average 1.6630525437864887) internal successors, (1994), 1564 states have internal predecessors, (1994), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2025-01-10 00:20:23,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2014 transitions. [2025-01-10 00:20:23,976 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2014 transitions. Word has length 98 [2025-01-10 00:20:23,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:20:23,977 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2014 transitions. [2025-01-10 00:20:23,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:20:23,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2014 transitions. [2025-01-10 00:20:23,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-10 00:20:23,977 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:20:23,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:20:23,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-10 00:20:23,977 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:20:23,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:20:23,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1500824769, now seen corresponding path program 1 times [2025-01-10 00:20:23,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:20:23,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141854807] [2025-01-10 00:20:23,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:20:23,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:20:23,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 00:20:24,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 00:20:24,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:20:24,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:20:24,711 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:20:24,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:20:24,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141854807] [2025-01-10 00:20:24,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141854807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:20:24,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:20:24,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-10 00:20:24,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176697523] [2025-01-10 00:20:24,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:20:24,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 00:20:24,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:20:24,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 00:20:24,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-01-10 00:20:24,712 INFO L87 Difference]: Start difference. First operand 1578 states and 2014 transitions. Second operand has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:20:28,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:20:28,421 INFO L93 Difference]: Finished difference Result 1581 states and 2022 transitions. [2025-01-10 00:20:28,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 00:20:28,421 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2025-01-10 00:20:28,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:20:28,424 INFO L225 Difference]: With dead ends: 1581 [2025-01-10 00:20:28,424 INFO L226 Difference]: Without dead ends: 1581 [2025-01-10 00:20:28,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2025-01-10 00:20:28,425 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 1171 mSDsluCounter, 6288 mSDsCounter, 0 mSdLazyCounter, 7627 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 7027 SdHoareTripleChecker+Invalid, 7653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 7627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:20:28,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 7027 Invalid, 7653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 7627 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-10 00:20:28,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2025-01-10 00:20:28,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1578. [2025-01-10 00:20:28,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1199 states have (on average 1.6613844870725605) internal successors, (1992), 1564 states have internal predecessors, (1992), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2025-01-10 00:20:28,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2012 transitions. [2025-01-10 00:20:28,439 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2012 transitions. Word has length 98 [2025-01-10 00:20:28,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:20:28,439 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2012 transitions. [2025-01-10 00:20:28,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:20:28,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2012 transitions. [2025-01-10 00:20:28,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-10 00:20:28,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:20:28,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:20:28,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-10 00:20:28,440 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:20:28,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:20:28,441 INFO L85 PathProgramCache]: Analyzing trace with hash -2062792601, now seen corresponding path program 1 times [2025-01-10 00:20:28,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:20:28,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634305332] [2025-01-10 00:20:28,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:20:28,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:20:28,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-10 00:20:28,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-10 00:20:28,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:20:28,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:20:28,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:20:28,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:20:28,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634305332] [2025-01-10 00:20:28,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634305332] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:20:28,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606107022] [2025-01-10 00:20:28,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:20:28,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:20:28,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:20:28,971 INFO L229 MonitoredProcess]: Starting monitored process 10 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:20:28,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 00:20:29,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-10 00:20:29,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-10 00:20:29,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:20:29,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:20:29,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-10 00:20:29,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:20:29,208 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:20:29,275 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:20:29,275 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:20:29,279 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:20:29,344 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:20:29,344 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:20:29,378 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:20:29,378 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:20:29,413 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:20:29,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:20:29,447 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:20:29,447 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:20:29,481 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:20:29,482 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:20:29,489 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:20:29,501 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 00:20:29,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-10 00:20:29,503 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:20:29,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:20:29,965 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2025-01-10 00:20:29,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 794 [2025-01-10 00:20:30,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606107022] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:20:30,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:20:30,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 23 [2025-01-10 00:20:30,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380191455] [2025-01-10 00:20:30,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:20:30,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 00:20:30,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:20:30,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 00:20:30,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=987, Unknown=52, NotChecked=0, Total=1190 [2025-01-10 00:20:30,036 INFO L87 Difference]: Start difference. First operand 1578 states and 2012 transitions. Second operand has 24 states, 21 states have (on average 7.142857142857143) internal successors, (150), 24 states have internal predecessors, (150), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:20:31,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:20:31,953 INFO L93 Difference]: Finished difference Result 1580 states and 2020 transitions. [2025-01-10 00:20:31,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 00:20:31,953 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.142857142857143) internal successors, (150), 24 states have internal predecessors, (150), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 99 [2025-01-10 00:20:31,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:20:31,955 INFO L225 Difference]: With dead ends: 1580 [2025-01-10 00:20:31,955 INFO L226 Difference]: Without dead ends: 1580 [2025-01-10 00:20:31,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=275, Invalid=1653, Unknown=52, NotChecked=0, Total=1980 [2025-01-10 00:20:31,956 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 1132 mSDsluCounter, 7158 mSDsCounter, 0 mSdLazyCounter, 5486 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 7896 SdHoareTripleChecker+Invalid, 5513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 5486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:20:31,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1142 Valid, 7896 Invalid, 5513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 5486 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-10 00:20:31,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2025-01-10 00:20:31,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1577. [2025-01-10 00:20:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1199 states have (on average 1.6597164303586323) internal successors, (1990), 1563 states have internal predecessors, (1990), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2025-01-10 00:20:31,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2010 transitions. [2025-01-10 00:20:31,969 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2010 transitions. Word has length 99 [2025-01-10 00:20:31,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:20:31,969 INFO L471 AbstractCegarLoop]: Abstraction has 1577 states and 2010 transitions. [2025-01-10 00:20:31,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.142857142857143) internal successors, (150), 24 states have internal predecessors, (150), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:20:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2010 transitions. [2025-01-10 00:20:31,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-10 00:20:31,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:20:31,971 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:20:31,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 00:20:32,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:20:32,171 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:20:32,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:20:32,172 INFO L85 PathProgramCache]: Analyzing trace with hash -2062792600, now seen corresponding path program 1 times [2025-01-10 00:20:32,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:20:32,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530685104] [2025-01-10 00:20:32,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:20:32,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:20:32,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-10 00:20:32,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-10 00:20:32,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:20:32,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:20:32,945 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:20:32,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:20:32,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530685104] [2025-01-10 00:20:32,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530685104] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:20:32,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305276526] [2025-01-10 00:20:32,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:20:32,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:20:32,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:20:32,948 INFO L229 MonitoredProcess]: Starting monitored process 11 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:20:32,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 00:20:33,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-10 00:20:33,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-10 00:20:33,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:20:33,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:20:33,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-01-10 00:20:33,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:20:33,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:20:33,308 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:20:33,308 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:20:33,313 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:20:33,331 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:20:33,333 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:20:33,388 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:20:33,390 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:20:33,512 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:20:33,514 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 73 treesize of output 66 [2025-01-10 00:20:33,518 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:20:33,622 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:20:33,622 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 73 treesize of output 66 [2025-01-10 00:20:33,633 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:20:33,706 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:20:33,707 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 73 treesize of output 66 [2025-01-10 00:20:33,712 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:20:33,776 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:20:33,776 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 73 treesize of output 66 [2025-01-10 00:20:33,802 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:20:33,865 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:20:33,866 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 73 treesize of output 66 [2025-01-10 00:20:33,869 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:20:33,885 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 42 treesize of output 18 [2025-01-10 00:20:33,890 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:20:33,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:20:33,935 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-01-10 00:20:33,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2025-01-10 00:20:33,943 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:20:33,943 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:20:33,963 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:20:33,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:20:34,419 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2455 (Array Int Int)) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2452 (Array Int Int)) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2450 (Array Int Int))) (< 0 (+ 1 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2450))) (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~mem53#1.base| v_ArrVal_2451) .cse0 v_ArrVal_2453) (select (select (store .cse1 .cse0 v_ArrVal_2452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2455))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))) (forall ((v_ArrVal_2455 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2452 (Array Int Int)) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2450 (Array Int Int))) (or (forall ((v_ArrVal_2456 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2450))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2452))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 4 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2451) .cse3 v_ArrVal_2453) .cse4 v_ArrVal_2455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2456) (select (select (store .cse5 .cse4 v_ArrVal_2454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))))) is different from false [2025-01-10 00:20:34,953 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |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|) .cse4))) (and (or (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2448 (Array Int Int)) (v_ArrVal_2455 (Array Int Int)) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2452 (Array Int Int)) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2450 (Array Int Int))) (< 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2449))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2450))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2448) .cse1 v_ArrVal_2451) .cse2 v_ArrVal_2453) (select (select (store .cse3 .cse2 v_ArrVal_2452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2455))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))) (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2448 (Array Int Int)) (v_ArrVal_2455 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2452 (Array Int Int)) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2450 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)) (forall ((v_ArrVal_2456 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2449))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2450))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2452))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ 4 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2448) .cse6 v_ArrVal_2451) .cse7 v_ArrVal_2453) .cse8 v_ArrVal_2455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2456) (select (select (store .cse9 .cse8 v_ArrVal_2454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2025-01-10 00:20:35,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:20:35,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 604 treesize of output 622 [2025-01-10 00:20:35,353 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_26 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_23))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_prenex_17))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_prenex_26))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_25) .cse0 v_prenex_18) .cse1 v_prenex_24) .cse2 v_prenex_21) (select (select (store .cse3 .cse2 v_prenex_22) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_19))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2448 (Array Int Int)) (v_ArrVal_2455 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2456 Int) (v_ArrVal_2453 (Array Int Int)) (v_ArrVal_2452 (Array Int Int)) (v_ArrVal_2462 (Array Int Int)) (v_ArrVal_2451 (Array Int Int)) (v_ArrVal_2461 (Array Int Int)) (v_ArrVal_2450 (Array Int Int))) (or (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2462))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2449))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2450))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2452))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2461) .cse7 v_ArrVal_2448) .cse8 v_ArrVal_2451) .cse9 v_ArrVal_2453) .cse10 v_ArrVal_2455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 3) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2456) (select (select (store .cse11 .cse10 v_ArrVal_2454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_7| |c_ULTIMATE.start_main_#t~mem50#1.base|))))) is different from false [2025-01-10 00:20:35,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305276526] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:20:35,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:20:35,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2025-01-10 00:20:35,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096747540] [2025-01-10 00:20:35,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:20:35,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-10 00:20:35,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:20:35,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-10 00:20:35,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1431, Unknown=35, NotChecked=240, Total=1892 [2025-01-10 00:20:35,359 INFO L87 Difference]: Start difference. First operand 1577 states and 2010 transitions. Second operand has 32 states, 29 states have (on average 5.517241379310345) internal successors, (160), 30 states have internal predecessors, (160), 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:20:43,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:20:43,955 INFO L93 Difference]: Finished difference Result 1579 states and 2018 transitions. [2025-01-10 00:20:43,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 00:20:43,956 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 5.517241379310345) internal successors, (160), 30 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 99 [2025-01-10 00:20:43,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:20:43,959 INFO L225 Difference]: With dead ends: 1579 [2025-01-10 00:20:43,959 INFO L226 Difference]: Without dead ends: 1579 [2025-01-10 00:20:43,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=321, Invalid=2206, Unknown=35, NotChecked=300, Total=2862 [2025-01-10 00:20:43,960 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 1139 mSDsluCounter, 10803 mSDsCounter, 0 mSdLazyCounter, 12837 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 11540 SdHoareTripleChecker+Invalid, 12868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 12837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:20:43,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 11540 Invalid, 12868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 12837 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2025-01-10 00:20:43,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2025-01-10 00:20:43,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1541. [2025-01-10 00:20:43,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1165 states have (on average 1.6763948497854078) internal successors, (1953), 1529 states have internal predecessors, (1953), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 00:20:43,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 1971 transitions. [2025-01-10 00:20:43,977 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 1971 transitions. Word has length 99 [2025-01-10 00:20:43,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:20:43,978 INFO L471 AbstractCegarLoop]: Abstraction has 1541 states and 1971 transitions. [2025-01-10 00:20:43,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 5.517241379310345) internal successors, (160), 30 states have internal predecessors, (160), 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:20:43,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 1971 transitions. [2025-01-10 00:20:43,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-10 00:20:43,979 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:20:43,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:20:43,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 00:20:44,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:20:44,180 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:20:44,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:20:44,181 INFO L85 PathProgramCache]: Analyzing trace with hash 461744704, now seen corresponding path program 1 times [2025-01-10 00:20:44,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:20:44,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397340082] [2025-01-10 00:20:44,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:20:44,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:20:44,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-10 00:20:44,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-10 00:20:44,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:20:44,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:20:44,665 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:20:44,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:20:44,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397340082] [2025-01-10 00:20:44,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397340082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:20:44,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:20:44,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-10 00:20:44,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962287828] [2025-01-10 00:20:44,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:20:44,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 00:20:44,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:20:44,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 00:20:44,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-01-10 00:20:44,668 INFO L87 Difference]: Start difference. First operand 1541 states and 1971 transitions. Second operand has 15 states, 14 states have (on average 7.071428571428571) internal successors, (99), 15 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)