./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 13:49:13,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 13:49:13,812 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 13:49:13,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 13:49:13,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 13:49:13,839 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 13:49:13,839 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 13:49:13,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 13:49:13,839 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 13:49:13,839 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 13:49:13,839 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 13:49:13,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 13:49:13,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 13:49:13,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 13:49:13,842 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 13:49:13,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 13:49:13,842 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 13:49:13,842 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 13:49:13,842 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 13:49:13,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 13:49:13,843 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 13:49:13,843 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 13:49:13,843 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 13:49:13,843 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 13:49:13,843 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 13:49:13,843 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 13:49:13,843 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 13:49:13,843 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 13:49:13,843 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 13:49:13,843 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 13:49:13,844 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 13:49:13,844 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 13:49:13,844 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 13:49:13,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:49:13,844 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 13:49:13,844 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 13:49:13,844 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 13:49:13,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 13:49:13,844 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 13:49:13,844 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 13:49:13,844 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 13:49:13,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 13:49:13,845 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/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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2025-03-17 13:49:14,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 13:49:14,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 13:49:14,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 13:49:14,059 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 13:49:14,059 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 13:49:14,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i [2025-03-17 13:49:15,138 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/572801e8c/c107693cf6e842ab9353a83830041df7/FLAG35a908584 [2025-03-17 13:49:15,413 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 13:49:15,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i [2025-03-17 13:49:15,424 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/572801e8c/c107693cf6e842ab9353a83830041df7/FLAG35a908584 [2025-03-17 13:49:15,437 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/572801e8c/c107693cf6e842ab9353a83830041df7 [2025-03-17 13:49:15,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 13:49:15,444 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 13:49:15,445 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 13:49:15,445 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 13:49:15,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 13:49:15,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:49:15" (1/1) ... [2025-03-17 13:49:15,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19df131b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:15, skipping insertion in model container [2025-03-17 13:49:15,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:49:15" (1/1) ... [2025-03-17 13:49:15,482 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 13:49:15,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-03-17 13:49:15,789 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:49:15,795 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:49:15,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-03-17 13:49:15,804 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:49:15,816 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:49:15,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:49:15,830 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 13:49:15,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:49:15,912 INFO L204 MainTranslator]: Completed translation [2025-03-17 13:49:15,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:15 WrapperNode [2025-03-17 13:49:15,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 13:49:15,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 13:49:15,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 13:49:15,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 13:49:15,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:15" (1/1) ... [2025-03-17 13:49:15,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:15" (1/1) ... [2025-03-17 13:49:15,953 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 779 [2025-03-17 13:49:15,954 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 13:49:15,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 13:49:15,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 13:49:15,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 13:49:15,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:15" (1/1) ... [2025-03-17 13:49:15,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:15" (1/1) ... [2025-03-17 13:49:15,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:15" (1/1) ... [2025-03-17 13:49:16,012 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2025-03-17 13:49:16,013 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:15" (1/1) ... [2025-03-17 13:49:16,013 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:15" (1/1) ... [2025-03-17 13:49:16,036 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:15" (1/1) ... [2025-03-17 13:49:16,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:15" (1/1) ... [2025-03-17 13:49:16,043 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:15" (1/1) ... [2025-03-17 13:49:16,046 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:15" (1/1) ... [2025-03-17 13:49:16,054 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 13:49:16,054 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 13:49:16,054 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 13:49:16,055 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 13:49:16,055 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:15" (1/1) ... [2025-03-17 13:49:16,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:49:16,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:49:16,083 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 13:49:16,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 13:49:16,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 13:49:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 13:49:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 13:49:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 13:49:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 13:49:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 13:49:16,104 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 13:49:16,104 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 13:49:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 13:49:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 13:49:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 13:49:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 13:49:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 13:49:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 13:49:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 13:49:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 13:49:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 13:49:16,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 13:49:16,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 13:49:16,240 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 13:49:16,242 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 13:49:17,420 INFO L? ?]: Removed 762 outVars from TransFormulas that were not future-live. [2025-03-17 13:49:17,421 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 13:49:17,461 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 13:49:17,461 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 13:49:17,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:49:17 BoogieIcfgContainer [2025-03-17 13:49:17,461 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 13:49:17,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 13:49:17,463 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 13:49:17,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 13:49:17,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:49:15" (1/3) ... [2025-03-17 13:49:17,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@489e8159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:49:17, skipping insertion in model container [2025-03-17 13:49:17,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:49:15" (2/3) ... [2025-03-17 13:49:17,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@489e8159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:49:17, skipping insertion in model container [2025-03-17 13:49:17,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:49:17" (3/3) ... [2025-03-17 13:49:17,468 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test1-1.i [2025-03-17 13:49:17,477 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 13:49:17,478 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_nondet_test1-1.i that has 3 procedures, 736 locations, 1 initial locations, 19 loop locations, and 320 error locations. [2025-03-17 13:49:17,519 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 13:49:17,528 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;@73499588, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 13:49:17,529 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2025-03-17 13:49:17,533 INFO L276 IsEmpty]: Start isEmpty. Operand has 731 states, 409 states have (on average 2.0684596577017116) internal successors, (846), 726 states have internal predecessors, (846), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:49:17,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 13:49:17,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:17,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 13:49:17,538 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr318REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:17,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:17,542 INFO L85 PathProgramCache]: Analyzing trace with hash 27827678, now seen corresponding path program 1 times [2025-03-17 13:49:17,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:17,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590494495] [2025-03-17 13:49:17,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:17,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:17,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 13:49:17,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 13:49:17,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:17,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:17,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:17,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:17,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590494495] [2025-03-17 13:49:17,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590494495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:17,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:17,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:49:17,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329821506] [2025-03-17 13:49:17,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:17,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 13:49:17,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:17,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 13:49:17,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 13:49:17,649 INFO L87 Difference]: Start difference. First operand has 731 states, 409 states have (on average 2.0684596577017116) internal successors, (846), 726 states have internal predecessors, (846), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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-03-17 13:49:17,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:17,724 INFO L93 Difference]: Finished difference Result 721 states and 809 transitions. [2025-03-17 13:49:17,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 13:49:17,725 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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-03-17 13:49:17,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:17,735 INFO L225 Difference]: With dead ends: 721 [2025-03-17 13:49:17,735 INFO L226 Difference]: Without dead ends: 719 [2025-03-17 13:49:17,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 13:49:17,739 INFO L435 NwaCegarLoop]: 787 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:17,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 787 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:49:17,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2025-03-17 13:49:17,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2025-03-17 13:49:17,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 403 states have (on average 1.9875930521091811) internal successors, (801), 714 states have internal predecessors, (801), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:49:17,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 807 transitions. [2025-03-17 13:49:17,797 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 807 transitions. Word has length 4 [2025-03-17 13:49:17,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:17,797 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 807 transitions. [2025-03-17 13:49:17,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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-03-17 13:49:17,798 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 807 transitions. [2025-03-17 13:49:17,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 13:49:17,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:17,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 13:49:17,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 13:49:17,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr318REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:17,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:17,800 INFO L85 PathProgramCache]: Analyzing trace with hash 27827709, now seen corresponding path program 1 times [2025-03-17 13:49:17,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:17,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115263005] [2025-03-17 13:49:17,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:17,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:17,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 13:49:17,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 13:49:17,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:17,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:17,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:17,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:17,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115263005] [2025-03-17 13:49:17,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115263005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:17,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:17,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:49:17,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467499412] [2025-03-17 13:49:17,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:17,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:49:17,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:17,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:49:17,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:49:17,879 INFO L87 Difference]: Start difference. First operand 719 states and 807 transitions. 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-03-17 13:49:18,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:18,302 INFO L93 Difference]: Finished difference Result 671 states and 760 transitions. [2025-03-17 13:49:18,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:49:18,302 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-03-17 13:49:18,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:18,305 INFO L225 Difference]: With dead ends: 671 [2025-03-17 13:49:18,305 INFO L226 Difference]: Without dead ends: 671 [2025-03-17 13:49:18,305 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-03-17 13:49:18,305 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 674 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:18,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 435 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 13:49:18,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-03-17 13:49:18,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 670. [2025-03-17 13:49:18,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 403 states have (on average 1.8660049627791564) internal successors, (752), 665 states have internal predecessors, (752), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:49:18,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 758 transitions. [2025-03-17 13:49:18,321 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 758 transitions. Word has length 4 [2025-03-17 13:49:18,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:18,321 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 758 transitions. [2025-03-17 13:49:18,321 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-03-17 13:49:18,321 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 758 transitions. [2025-03-17 13:49:18,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 13:49:18,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:18,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 13:49:18,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 13:49:18,322 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr319REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:18,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:18,322 INFO L85 PathProgramCache]: Analyzing trace with hash 27827710, now seen corresponding path program 1 times [2025-03-17 13:49:18,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:18,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168220558] [2025-03-17 13:49:18,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:18,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:18,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 13:49:18,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 13:49:18,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:18,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:18,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:18,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:18,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168220558] [2025-03-17 13:49:18,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168220558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:18,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:18,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:49:18,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888849848] [2025-03-17 13:49:18,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:18,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:49:18,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:18,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:49:18,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:49:18,390 INFO L87 Difference]: Start difference. First operand 670 states and 758 transitions. 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-03-17 13:49:18,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:18,775 INFO L93 Difference]: Finished difference Result 746 states and 840 transitions. [2025-03-17 13:49:18,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:49:18,776 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-03-17 13:49:18,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:18,778 INFO L225 Difference]: With dead ends: 746 [2025-03-17 13:49:18,778 INFO L226 Difference]: Without dead ends: 746 [2025-03-17 13:49:18,778 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-03-17 13:49:18,778 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 413 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:18,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 792 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 13:49:18,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-03-17 13:49:18,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 699. [2025-03-17 13:49:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 443 states have (on average 1.8510158013544018) internal successors, (820), 694 states have internal predecessors, (820), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:49:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 826 transitions. [2025-03-17 13:49:18,789 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 826 transitions. Word has length 4 [2025-03-17 13:49:18,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:18,789 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 826 transitions. [2025-03-17 13:49:18,789 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-03-17 13:49:18,789 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 826 transitions. [2025-03-17 13:49:18,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 13:49:18,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:18,789 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 13:49:18,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 13:49:18,789 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:18,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:18,790 INFO L85 PathProgramCache]: Analyzing trace with hash 26990611, now seen corresponding path program 1 times [2025-03-17 13:49:18,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:18,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095143718] [2025-03-17 13:49:18,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:18,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:18,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 13:49:18,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 13:49:18,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:18,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:18,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:18,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095143718] [2025-03-17 13:49:18,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095143718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:18,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:18,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:49:18,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911006589] [2025-03-17 13:49:18,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:18,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:49:18,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:18,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:49:18,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:49:18,816 INFO L87 Difference]: Start difference. First operand 699 states and 826 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 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-03-17 13:49:18,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:18,883 INFO L93 Difference]: Finished difference Result 1377 states and 1630 transitions. [2025-03-17 13:49:18,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:49:18,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 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-03-17 13:49:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:18,888 INFO L225 Difference]: With dead ends: 1377 [2025-03-17 13:49:18,888 INFO L226 Difference]: Without dead ends: 1377 [2025-03-17 13:49:18,888 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-03-17 13:49:18,890 INFO L435 NwaCegarLoop]: 946 mSDtfsCounter, 718 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:18,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 1666 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:49:18,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2025-03-17 13:49:18,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 700. [2025-03-17 13:49:18,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 444 states have (on average 1.8490990990990992) internal successors, (821), 695 states have internal predecessors, (821), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:49:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 827 transitions. [2025-03-17 13:49:18,910 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 827 transitions. Word has length 4 [2025-03-17 13:49:18,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:18,910 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 827 transitions. [2025-03-17 13:49:18,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 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-03-17 13:49:18,910 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 827 transitions. [2025-03-17 13:49:18,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 13:49:18,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:18,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:49:18,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 13:49:18,911 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:18,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:18,912 INFO L85 PathProgramCache]: Analyzing trace with hash -633105120, now seen corresponding path program 1 times [2025-03-17 13:49:18,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:18,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065517532] [2025-03-17 13:49:18,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:18,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:18,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 13:49:18,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 13:49:18,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:18,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:18,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:18,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065517532] [2025-03-17 13:49:18,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065517532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:18,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:18,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:49:18,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876077939] [2025-03-17 13:49:18,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:18,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:49:18,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:18,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:49:18,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:49:18,992 INFO L87 Difference]: Start difference. First operand 700 states and 827 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) 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-03-17 13:49:19,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:19,454 INFO L93 Difference]: Finished difference Result 726 states and 880 transitions. [2025-03-17 13:49:19,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:49:19,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) 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-03-17 13:49:19,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:19,457 INFO L225 Difference]: With dead ends: 726 [2025-03-17 13:49:19,457 INFO L226 Difference]: Without dead ends: 726 [2025-03-17 13:49:19,457 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-03-17 13:49:19,458 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 938 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:19,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 684 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 13:49:19,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2025-03-17 13:49:19,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 677. [2025-03-17 13:49:19,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 444 states have (on average 1.7972972972972974) internal successors, (798), 672 states have internal predecessors, (798), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:49:19,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 804 transitions. [2025-03-17 13:49:19,469 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 804 transitions. Word has length 13 [2025-03-17 13:49:19,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:19,470 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 804 transitions. [2025-03-17 13:49:19,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) 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-03-17 13:49:19,470 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 804 transitions. [2025-03-17 13:49:19,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 13:49:19,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:19,470 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:49:19,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 13:49:19,470 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:19,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:19,471 INFO L85 PathProgramCache]: Analyzing trace with hash -633105119, now seen corresponding path program 1 times [2025-03-17 13:49:19,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:19,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738930393] [2025-03-17 13:49:19,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:19,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:19,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 13:49:19,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 13:49:19,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:19,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:19,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:19,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:19,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738930393] [2025-03-17 13:49:19,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738930393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:19,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:19,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:49:19,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221199298] [2025-03-17 13:49:19,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:19,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:49:19,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:19,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:49:19,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:49:19,532 INFO L87 Difference]: Start difference. First operand 677 states and 804 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-03-17 13:49:19,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:19,566 INFO L93 Difference]: Finished difference Result 602 states and 701 transitions. [2025-03-17 13:49:19,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:49:19,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-03-17 13:49:19,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:19,568 INFO L225 Difference]: With dead ends: 602 [2025-03-17 13:49:19,568 INFO L226 Difference]: Without dead ends: 602 [2025-03-17 13:49:19,568 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-03-17 13:49:19,569 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 60 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:19,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1141 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:49:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-03-17 13:49:19,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2025-03-17 13:49:19,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 381 states have (on average 1.8241469816272966) internal successors, (695), 597 states have internal predecessors, (695), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:49:19,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 701 transitions. [2025-03-17 13:49:19,577 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 701 transitions. Word has length 13 [2025-03-17 13:49:19,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:19,577 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 701 transitions. [2025-03-17 13:49:19,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-03-17 13:49:19,577 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 701 transitions. [2025-03-17 13:49:19,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 13:49:19,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:19,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:49:19,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 13:49:19,578 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr289REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:19,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:19,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1848453492, now seen corresponding path program 1 times [2025-03-17 13:49:19,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:19,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946464322] [2025-03-17 13:49:19,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:19,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:19,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 13:49:19,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 13:49:19,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:19,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:19,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:19,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:19,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946464322] [2025-03-17 13:49:19,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946464322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:19,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:19,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:49:19,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304576322] [2025-03-17 13:49:19,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:19,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:49:19,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:19,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:49:19,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:49:19,629 INFO L87 Difference]: Start difference. First operand 602 states and 701 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-03-17 13:49:19,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:19,688 INFO L93 Difference]: Finished difference Result 584 states and 676 transitions. [2025-03-17 13:49:19,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:49:19,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2025-03-17 13:49:19,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:19,690 INFO L225 Difference]: With dead ends: 584 [2025-03-17 13:49:19,690 INFO L226 Difference]: Without dead ends: 584 [2025-03-17 13:49:19,691 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-03-17 13:49:19,691 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 41 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:19,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1658 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:49:19,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-03-17 13:49:19,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 581. [2025-03-17 13:49:19,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 367 states have (on average 1.8174386920980927) internal successors, (667), 576 states have internal predecessors, (667), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:49:19,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 673 transitions. [2025-03-17 13:49:19,700 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 673 transitions. Word has length 14 [2025-03-17 13:49:19,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:19,701 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 673 transitions. [2025-03-17 13:49:19,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-03-17 13:49:19,701 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 673 transitions. [2025-03-17 13:49:19,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 13:49:19,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:19,701 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] [2025-03-17 13:49:19,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 13:49:19,701 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr275REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:19,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:19,702 INFO L85 PathProgramCache]: Analyzing trace with hash 807664970, now seen corresponding path program 1 times [2025-03-17 13:49:19,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:19,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882976124] [2025-03-17 13:49:19,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:19,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:19,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 13:49:19,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 13:49:19,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:19,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:19,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:19,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:19,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882976124] [2025-03-17 13:49:19,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882976124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:19,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:19,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:49:19,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767829167] [2025-03-17 13:49:19,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:19,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:49:19,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:19,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:49:19,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:49:19,859 INFO L87 Difference]: Start difference. First operand 581 states and 673 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-03-17 13:49:20,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:20,279 INFO L93 Difference]: Finished difference Result 673 states and 759 transitions. [2025-03-17 13:49:20,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:49:20,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 28 [2025-03-17 13:49:20,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:20,282 INFO L225 Difference]: With dead ends: 673 [2025-03-17 13:49:20,282 INFO L226 Difference]: Without dead ends: 673 [2025-03-17 13:49:20,282 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-03-17 13:49:20,282 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 415 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:20,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 968 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 13:49:20,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-17 13:49:20,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 577. [2025-03-17 13:49:20,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 367 states have (on average 1.8065395095367847) internal successors, (663), 572 states have internal predecessors, (663), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:49:20,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 669 transitions. [2025-03-17 13:49:20,291 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 669 transitions. Word has length 28 [2025-03-17 13:49:20,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:20,291 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 669 transitions. [2025-03-17 13:49:20,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-03-17 13:49:20,291 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 669 transitions. [2025-03-17 13:49:20,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 13:49:20,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:20,292 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] [2025-03-17 13:49:20,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 13:49:20,292 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr260REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:20,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:20,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1447924578, now seen corresponding path program 1 times [2025-03-17 13:49:20,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:20,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998413738] [2025-03-17 13:49:20,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:20,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:20,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 13:49:20,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 13:49:20,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:20,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:20,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:20,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:20,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998413738] [2025-03-17 13:49:20,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998413738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:20,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:20,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:49:20,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937404219] [2025-03-17 13:49:20,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:20,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:49:20,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:20,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:49:20,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:49:20,411 INFO L87 Difference]: Start difference. First operand 577 states and 669 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-03-17 13:49:20,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:20,467 INFO L93 Difference]: Finished difference Result 577 states and 665 transitions. [2025-03-17 13:49:20,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:49:20,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2025-03-17 13:49:20,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:20,469 INFO L225 Difference]: With dead ends: 577 [2025-03-17 13:49:20,469 INFO L226 Difference]: Without dead ends: 577 [2025-03-17 13:49:20,469 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-03-17 13:49:20,469 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 21 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:20,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1640 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:49:20,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-03-17 13:49:20,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2025-03-17 13:49:20,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 367 states have (on average 1.7956403269754768) internal successors, (659), 572 states have internal predecessors, (659), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:49:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 665 transitions. [2025-03-17 13:49:20,479 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 665 transitions. Word has length 62 [2025-03-17 13:49:20,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:20,479 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 665 transitions. [2025-03-17 13:49:20,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-03-17 13:49:20,479 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 665 transitions. [2025-03-17 13:49:20,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-17 13:49:20,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:20,481 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 13:49:20,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 13:49:20,481 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr260REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:20,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:20,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1270020634, now seen corresponding path program 1 times [2025-03-17 13:49:20,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:20,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539736343] [2025-03-17 13:49:20,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:20,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:20,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 13:49:20,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 13:49:20,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:20,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:20,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:20,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:20,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539736343] [2025-03-17 13:49:20,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539736343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:20,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:20,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:49:20,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379772424] [2025-03-17 13:49:20,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:20,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:49:20,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:20,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:49:20,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:49:20,599 INFO L87 Difference]: Start difference. First operand 577 states and 665 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 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-03-17 13:49:20,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:20,652 INFO L93 Difference]: Finished difference Result 671 states and 786 transitions. [2025-03-17 13:49:20,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:49:20,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 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 70 [2025-03-17 13:49:20,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:20,655 INFO L225 Difference]: With dead ends: 671 [2025-03-17 13:49:20,655 INFO L226 Difference]: Without dead ends: 671 [2025-03-17 13:49:20,655 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-03-17 13:49:20,655 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 54 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:20,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1114 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:49:20,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-03-17 13:49:20,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2025-03-17 13:49:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 461 states have (on average 1.6919739696312364) internal successors, (780), 666 states have internal predecessors, (780), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:49:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 786 transitions. [2025-03-17 13:49:20,666 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 786 transitions. Word has length 70 [2025-03-17 13:49:20,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:20,666 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 786 transitions. [2025-03-17 13:49:20,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 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-03-17 13:49:20,667 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 786 transitions. [2025-03-17 13:49:20,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 13:49:20,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:20,667 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] [2025-03-17 13:49:20,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 13:49:20,668 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr231REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:20,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:20,668 INFO L85 PathProgramCache]: Analyzing trace with hash -819628265, now seen corresponding path program 1 times [2025-03-17 13:49:20,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:20,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700396187] [2025-03-17 13:49:20,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:20,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:20,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 13:49:20,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 13:49:20,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:20,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:21,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:21,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:21,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700396187] [2025-03-17 13:49:21,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700396187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:21,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:21,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:49:21,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038674466] [2025-03-17 13:49:21,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:21,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:49:21,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:21,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:49:21,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:49:21,048 INFO L87 Difference]: Start difference. First operand 671 states and 786 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 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-03-17 13:49:21,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:21,660 INFO L93 Difference]: Finished difference Result 633 states and 748 transitions. [2025-03-17 13:49:21,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:49:21,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 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 73 [2025-03-17 13:49:21,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:21,663 INFO L225 Difference]: With dead ends: 633 [2025-03-17 13:49:21,663 INFO L226 Difference]: Without dead ends: 633 [2025-03-17 13:49:21,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:49:21,663 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 468 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:21,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 628 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 13:49:21,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-17 13:49:21,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 593. [2025-03-17 13:49:21,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 421 states have (on average 1.5748218527315914) internal successors, (663), 588 states have internal predecessors, (663), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:49:21,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 669 transitions. [2025-03-17 13:49:21,671 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 669 transitions. Word has length 73 [2025-03-17 13:49:21,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:21,672 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 669 transitions. [2025-03-17 13:49:21,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 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-03-17 13:49:21,672 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 669 transitions. [2025-03-17 13:49:21,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 13:49:21,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:21,672 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] [2025-03-17 13:49:21,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 13:49:21,673 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr224REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:21,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:21,673 INFO L85 PathProgramCache]: Analyzing trace with hash 811624562, now seen corresponding path program 1 times [2025-03-17 13:49:21,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:21,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881213031] [2025-03-17 13:49:21,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:21,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:21,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 13:49:21,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 13:49:21,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:21,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:21,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:21,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:21,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881213031] [2025-03-17 13:49:21,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881213031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:21,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:21,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:49:21,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601770908] [2025-03-17 13:49:21,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:21,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:49:21,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:21,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:49:21,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:49:21,878 INFO L87 Difference]: Start difference. First operand 593 states and 669 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 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-03-17 13:49:22,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:22,290 INFO L93 Difference]: Finished difference Result 592 states and 668 transitions. [2025-03-17 13:49:22,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:49:22,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2025-03-17 13:49:22,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:22,292 INFO L225 Difference]: With dead ends: 592 [2025-03-17 13:49:22,293 INFO L226 Difference]: Without dead ends: 592 [2025-03-17 13:49:22,293 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-03-17 13:49:22,293 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 2 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:22,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1433 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 13:49:22,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-17 13:49:22,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2025-03-17 13:49:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 421 states have (on average 1.5724465558194773) internal successors, (662), 587 states have internal predecessors, (662), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:49:22,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 668 transitions. [2025-03-17 13:49:22,300 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 668 transitions. Word has length 78 [2025-03-17 13:49:22,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:22,301 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 668 transitions. [2025-03-17 13:49:22,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 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-03-17 13:49:22,301 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 668 transitions. [2025-03-17 13:49:22,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 13:49:22,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:22,302 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] [2025-03-17 13:49:22,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 13:49:22,302 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr225REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:22,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:22,302 INFO L85 PathProgramCache]: Analyzing trace with hash 811624563, now seen corresponding path program 1 times [2025-03-17 13:49:22,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:22,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396979711] [2025-03-17 13:49:22,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:22,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:22,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 13:49:22,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 13:49:22,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:22,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:22,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:22,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:22,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396979711] [2025-03-17 13:49:22,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396979711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:22,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:22,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:49:22,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083952872] [2025-03-17 13:49:22,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:22,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:49:22,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:22,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:49:22,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:49:22,668 INFO L87 Difference]: Start difference. First operand 592 states and 668 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 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-03-17 13:49:23,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:23,087 INFO L93 Difference]: Finished difference Result 591 states and 667 transitions. [2025-03-17 13:49:23,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:49:23,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2025-03-17 13:49:23,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:23,089 INFO L225 Difference]: With dead ends: 591 [2025-03-17 13:49:23,089 INFO L226 Difference]: Without dead ends: 591 [2025-03-17 13:49:23,089 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-03-17 13:49:23,090 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 1 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:23,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1442 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 13:49:23,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-17 13:49:23,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-03-17 13:49:23,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 420 states have (on average 1.5738095238095238) internal successors, (661), 586 states have internal predecessors, (661), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:49:23,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 667 transitions. [2025-03-17 13:49:23,099 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 667 transitions. Word has length 78 [2025-03-17 13:49:23,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:23,100 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 667 transitions. [2025-03-17 13:49:23,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 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-03-17 13:49:23,100 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 667 transitions. [2025-03-17 13:49:23,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 13:49:23,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:23,101 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-03-17 13:49:23,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 13:49:23,101 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr220REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:23,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:23,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1603258703, now seen corresponding path program 1 times [2025-03-17 13:49:23,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:23,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78135094] [2025-03-17 13:49:23,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:23,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:23,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 13:49:23,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 13:49:23,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:23,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:23,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:23,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:23,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78135094] [2025-03-17 13:49:23,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78135094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:23,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:23,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 13:49:23,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028975782] [2025-03-17 13:49:23,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:23,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:49:23,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:23,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:49:23,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:49:23,280 INFO L87 Difference]: Start difference. First operand 591 states and 667 transitions. Second operand has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 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-03-17 13:49:23,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:23,786 INFO L93 Difference]: Finished difference Result 603 states and 682 transitions. [2025-03-17 13:49:23,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 13:49:23,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 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 86 [2025-03-17 13:49:23,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:23,789 INFO L225 Difference]: With dead ends: 603 [2025-03-17 13:49:23,789 INFO L226 Difference]: Without dead ends: 603 [2025-03-17 13:49:23,789 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-03-17 13:49:23,790 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 6 mSDsluCounter, 1725 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:23,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2246 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 13:49:23,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-03-17 13:49:23,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 597. [2025-03-17 13:49:23,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 425 states have (on average 1.571764705882353) internal successors, (668), 591 states have internal predecessors, (668), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 13:49:23,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 677 transitions. [2025-03-17 13:49:23,797 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 677 transitions. Word has length 86 [2025-03-17 13:49:23,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:23,797 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 677 transitions. [2025-03-17 13:49:23,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 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-03-17 13:49:23,797 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 677 transitions. [2025-03-17 13:49:23,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 13:49:23,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:23,798 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-03-17 13:49:23,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 13:49:23,798 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr221REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:23,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:23,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1603258704, now seen corresponding path program 1 times [2025-03-17 13:49:23,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:23,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094899099] [2025-03-17 13:49:23,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:23,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:23,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 13:49:23,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 13:49:23,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:23,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:24,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:24,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:24,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094899099] [2025-03-17 13:49:24,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094899099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:24,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:24,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:49:24,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123152854] [2025-03-17 13:49:24,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:24,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:49:24,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:24,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:49:24,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:49:24,150 INFO L87 Difference]: Start difference. First operand 597 states and 677 transitions. Second operand has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 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-03-17 13:49:24,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:24,656 INFO L93 Difference]: Finished difference Result 597 states and 676 transitions. [2025-03-17 13:49:24,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:49:24,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 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 86 [2025-03-17 13:49:24,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:24,658 INFO L225 Difference]: With dead ends: 597 [2025-03-17 13:49:24,658 INFO L226 Difference]: Without dead ends: 597 [2025-03-17 13:49:24,659 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-03-17 13:49:24,659 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 1 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1858 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:24,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1858 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 13:49:24,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-17 13:49:24,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2025-03-17 13:49:24,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 425 states have (on average 1.5694117647058823) internal successors, (667), 591 states have internal predecessors, (667), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 13:49:24,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 676 transitions. [2025-03-17 13:49:24,667 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 676 transitions. Word has length 86 [2025-03-17 13:49:24,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:24,668 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 676 transitions. [2025-03-17 13:49:24,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 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-03-17 13:49:24,668 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 676 transitions. [2025-03-17 13:49:24,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 13:49:24,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:24,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:49:24,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 13:49:24,669 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr220REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:24,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:24,669 INFO L85 PathProgramCache]: Analyzing trace with hash 685039887, now seen corresponding path program 1 times [2025-03-17 13:49:24,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:24,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341170190] [2025-03-17 13:49:24,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:24,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:24,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 13:49:24,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 13:49:24,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:24,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:24,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:24,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:24,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341170190] [2025-03-17 13:49:24,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341170190] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:24,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622021911] [2025-03-17 13:49:24,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:24,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:49:24,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:49:24,996 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:49:24,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 13:49:25,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 13:49:25,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 13:49:25,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:25,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:25,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 13:49:25,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:49:25,165 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-03-17 13:49:25,260 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:49:25,260 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-03-17 13:49:25,274 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-03-17 13:49:25,324 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:25,325 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-03-17 13:49:25,348 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-03-17 13:49:25,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:25,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:49:25,394 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-03-17 13:49:25,395 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-03-17 13:49:25,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622021911] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:25,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:49:25,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2025-03-17 13:49:25,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965916972] [2025-03-17 13:49:25,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:49:25,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 13:49:25,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:25,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 13:49:25,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=172, Unknown=3, NotChecked=0, Total=210 [2025-03-17 13:49:25,425 INFO L87 Difference]: Start difference. First operand 597 states and 676 transitions. Second operand has 14 states, 12 states have (on average 10.5) internal successors, (126), 13 states have internal predecessors, (126), 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-03-17 13:49:26,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:26,583 INFO L93 Difference]: Finished difference Result 596 states and 675 transitions. [2025-03-17 13:49:26,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:49:26,584 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.5) internal successors, (126), 13 states have internal predecessors, (126), 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 87 [2025-03-17 13:49:26,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:26,586 INFO L225 Difference]: With dead ends: 596 [2025-03-17 13:49:26,586 INFO L226 Difference]: Without dead ends: 596 [2025-03-17 13:49:26,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=375, Unknown=3, NotChecked=0, Total=462 [2025-03-17 13:49:26,586 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 469 mSDsluCounter, 2595 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 2901 SdHoareTripleChecker+Invalid, 2505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:26,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 2901 Invalid, 2505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 13:49:26,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-17 13:49:26,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-03-17 13:49:26,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 425 states have (on average 1.5670588235294118) internal successors, (666), 590 states have internal predecessors, (666), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 13:49:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 675 transitions. [2025-03-17 13:49:26,594 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 675 transitions. Word has length 87 [2025-03-17 13:49:26,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:26,594 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 675 transitions. [2025-03-17 13:49:26,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.5) internal successors, (126), 13 states have internal predecessors, (126), 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-03-17 13:49:26,594 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 675 transitions. [2025-03-17 13:49:26,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 13:49:26,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:26,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:49:26,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 13:49:26,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 13:49:26,795 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr221REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:26,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:26,795 INFO L85 PathProgramCache]: Analyzing trace with hash 685039888, now seen corresponding path program 1 times [2025-03-17 13:49:26,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:26,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836921765] [2025-03-17 13:49:26,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:26,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:26,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 13:49:26,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 13:49:26,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:26,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:27,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:27,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:27,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836921765] [2025-03-17 13:49:27,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836921765] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:27,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997130217] [2025-03-17 13:49:27,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:27,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:49:27,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:49:27,278 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:49:27,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 13:49:27,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 13:49:27,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 13:49:27,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:27,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:27,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 13:49:27,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:49:27,415 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-03-17 13:49:27,493 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:49:27,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 13:49:27,512 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-03-17 13:49:27,515 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-03-17 13:49:27,632 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:27,633 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-03-17 13:49:27,637 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-03-17 13:49:27,676 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-03-17 13:49:27,687 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-03-17 13:49:27,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:27,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:49:27,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:49:27,795 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-03-17 13:49:27,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997130217] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:27,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:49:27,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2025-03-17 13:49:27,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646940294] [2025-03-17 13:49:27,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:49:27,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 13:49:27,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:27,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 13:49:27,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=391, Unknown=8, NotChecked=0, Total=462 [2025-03-17 13:49:27,903 INFO L87 Difference]: Start difference. First operand 596 states and 675 transitions. Second operand has 19 states, 16 states have (on average 8.625) internal successors, (138), 19 states have internal predecessors, (138), 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-03-17 13:49:28,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:28,992 INFO L93 Difference]: Finished difference Result 595 states and 674 transitions. [2025-03-17 13:49:28,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 13:49:28,992 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.625) internal successors, (138), 19 states have internal predecessors, (138), 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 87 [2025-03-17 13:49:28,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:28,994 INFO L225 Difference]: With dead ends: 595 [2025-03-17 13:49:28,994 INFO L226 Difference]: Without dead ends: 595 [2025-03-17 13:49:28,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=542, Unknown=8, NotChecked=0, Total=650 [2025-03-17 13:49:28,994 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 465 mSDsluCounter, 2010 mSDsCounter, 0 mSdLazyCounter, 2563 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 2315 SdHoareTripleChecker+Invalid, 2583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:28,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 2315 Invalid, 2583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2563 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 13:49:28,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-03-17 13:49:28,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 589. [2025-03-17 13:49:29,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 420 states have (on average 1.569047619047619) internal successors, (659), 584 states have internal predecessors, (659), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:49:29,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 665 transitions. [2025-03-17 13:49:29,001 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 665 transitions. Word has length 87 [2025-03-17 13:49:29,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:29,001 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 665 transitions. [2025-03-17 13:49:29,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.625) internal successors, (138), 19 states have internal predecessors, (138), 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-03-17 13:49:29,001 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 665 transitions. [2025-03-17 13:49:29,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 13:49:29,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:29,002 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-03-17 13:49:29,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 13:49:29,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 13:49:29,203 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr216REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:29,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:29,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1650838936, now seen corresponding path program 1 times [2025-03-17 13:49:29,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:29,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689325456] [2025-03-17 13:49:29,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:29,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:29,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 13:49:29,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 13:49:29,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:29,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:29,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:29,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:29,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689325456] [2025-03-17 13:49:29,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689325456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:29,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:29,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 13:49:29,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29443492] [2025-03-17 13:49:29,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:29,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 13:49:29,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:29,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 13:49:29,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-17 13:49:29,509 INFO L87 Difference]: Start difference. First operand 589 states and 665 transitions. Second operand has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 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-03-17 13:49:30,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:30,309 INFO L93 Difference]: Finished difference Result 599 states and 678 transitions. [2025-03-17 13:49:30,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 13:49:30,310 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 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-03-17 13:49:30,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:30,311 INFO L225 Difference]: With dead ends: 599 [2025-03-17 13:49:30,311 INFO L226 Difference]: Without dead ends: 599 [2025-03-17 13:49:30,311 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-03-17 13:49:30,312 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 498 mSDsluCounter, 2323 mSDsCounter, 0 mSdLazyCounter, 2255 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 2628 SdHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:30,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 2628 Invalid, 2269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2255 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 13:49:30,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-17 13:49:30,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 598. [2025-03-17 13:49:30,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 428 states have (on average 1.5630841121495327) internal successors, (669), 592 states have internal predecessors, (669), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 13:49:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 678 transitions. [2025-03-17 13:49:30,319 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 678 transitions. Word has length 89 [2025-03-17 13:49:30,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:30,319 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 678 transitions. [2025-03-17 13:49:30,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 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-03-17 13:49:30,320 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 678 transitions. [2025-03-17 13:49:30,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 13:49:30,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:30,321 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-03-17 13:49:30,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 13:49:30,321 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr217REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:30,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:30,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1650838935, now seen corresponding path program 1 times [2025-03-17 13:49:30,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:30,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114695293] [2025-03-17 13:49:30,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:30,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:30,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 13:49:30,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 13:49:30,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:30,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:30,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:30,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:30,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114695293] [2025-03-17 13:49:30,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114695293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:30,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:30,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 13:49:30,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28125263] [2025-03-17 13:49:30,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:30,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 13:49:30,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:30,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 13:49:30,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 13:49:30,769 INFO L87 Difference]: Start difference. First operand 598 states and 678 transitions. Second operand has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 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-03-17 13:49:31,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:31,587 INFO L93 Difference]: Finished difference Result 598 states and 677 transitions. [2025-03-17 13:49:31,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 13:49:31,588 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 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-03-17 13:49:31,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:31,589 INFO L225 Difference]: With dead ends: 598 [2025-03-17 13:49:31,589 INFO L226 Difference]: Without dead ends: 598 [2025-03-17 13:49:31,589 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-03-17 13:49:31,590 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 490 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 2045 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 2057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:31,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 1753 Invalid, 2057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2045 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 13:49:31,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-03-17 13:49:31,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2025-03-17 13:49:31,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 428 states have (on average 1.560747663551402) internal successors, (668), 592 states have internal predecessors, (668), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 13:49:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 677 transitions. [2025-03-17 13:49:31,596 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 677 transitions. Word has length 89 [2025-03-17 13:49:31,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:31,596 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 677 transitions. [2025-03-17 13:49:31,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 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-03-17 13:49:31,597 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 677 transitions. [2025-03-17 13:49:31,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 13:49:31,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:31,597 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:49:31,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 13:49:31,597 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr216REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:31,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:31,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1660878168, now seen corresponding path program 1 times [2025-03-17 13:49:31,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:31,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449208762] [2025-03-17 13:49:31,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:31,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:31,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 13:49:31,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 13:49:31,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:31,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:31,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:31,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449208762] [2025-03-17 13:49:31,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449208762] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:31,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466010895] [2025-03-17 13:49:31,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:31,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:49:31,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:49:31,894 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:49:31,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 13:49:32,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 13:49:32,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 13:49:32,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:32,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:32,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 13:49:32,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:49:32,053 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-03-17 13:49:32,135 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:49:32,135 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-03-17 13:49:32,142 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-03-17 13:49:32,202 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:32,202 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-03-17 13:49:32,247 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:32,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 13:49:32,258 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-03-17 13:49:32,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:32,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:49:32,287 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_881 (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_881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-03-17 13:49:32,319 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-03-17 13:49:32,319 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-03-17 13:49:32,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466010895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:32,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:49:32,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 16 [2025-03-17 13:49:32,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453934849] [2025-03-17 13:49:32,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:49:32,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 13:49:32,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:32,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 13:49:32,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=277, Unknown=15, NotChecked=34, Total=380 [2025-03-17 13:49:32,355 INFO L87 Difference]: Start difference. First operand 598 states and 677 transitions. Second operand has 17 states, 15 states have (on average 9.133333333333333) internal successors, (137), 17 states have internal predecessors, (137), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:49:33,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:33,142 INFO L93 Difference]: Finished difference Result 597 states and 676 transitions. [2025-03-17 13:49:33,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:49:33,143 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 9.133333333333333) internal successors, (137), 17 states have internal predecessors, (137), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 90 [2025-03-17 13:49:33,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:33,144 INFO L225 Difference]: With dead ends: 597 [2025-03-17 13:49:33,144 INFO L226 Difference]: Without dead ends: 597 [2025-03-17 13:49:33,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=532, Unknown=15, NotChecked=48, Total=702 [2025-03-17 13:49:33,145 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 461 mSDsluCounter, 2325 mSDsCounter, 0 mSdLazyCounter, 2240 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 2630 SdHoareTripleChecker+Invalid, 2255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:33,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 2630 Invalid, 2255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2240 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 13:49:33,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-17 13:49:33,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2025-03-17 13:49:33,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 428 states have (on average 1.558411214953271) internal successors, (667), 591 states have internal predecessors, (667), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 13:49:33,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 676 transitions. [2025-03-17 13:49:33,155 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 676 transitions. Word has length 90 [2025-03-17 13:49:33,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:33,155 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 676 transitions. [2025-03-17 13:49:33,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 9.133333333333333) internal successors, (137), 17 states have internal predecessors, (137), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:49:33,155 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 676 transitions. [2025-03-17 13:49:33,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 13:49:33,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:33,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:49:33,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 13:49:33,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:49:33,356 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr217REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:33,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:33,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1660878167, now seen corresponding path program 1 times [2025-03-17 13:49:33,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:33,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984038456] [2025-03-17 13:49:33,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:33,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:33,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 13:49:33,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 13:49:33,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:33,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:33,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:33,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:33,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984038456] [2025-03-17 13:49:33,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984038456] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:33,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244151446] [2025-03-17 13:49:33,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:33,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:49:33,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:49:33,790 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:49:33,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 13:49:33,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 13:49:33,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 13:49:33,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:33,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:33,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 13:49:33,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:49:33,941 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-03-17 13:49:34,023 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:49:34,023 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-03-17 13:49:34,043 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-03-17 13:49:34,045 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-03-17 13:49:34,150 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:34,150 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-03-17 13:49:34,154 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-03-17 13:49:34,205 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:34,205 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-03-17 13:49:34,209 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-03-17 13:49:34,221 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-03-17 13:49:34,224 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-03-17 13:49:34,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:34,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:49:34,289 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1021 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1020) |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~mem53#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1020 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))))) is different from false [2025-03-17 13:49:34,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:49:34,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 88 [2025-03-17 13:49:34,418 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1027) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1026) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_2) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_3) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_prenex_4) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_#t~mem51#1.offset| 37))) (forall ((v_prenex_3 (Array Int Int)) (v_ArrVal_1021 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_3))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1021)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem51#1.base|)))) is different from false [2025-03-17 13:49:34,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244151446] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:34,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:49:34,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2025-03-17 13:49:34,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562193764] [2025-03-17 13:49:34,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:49:34,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 13:49:34,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:34,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 13:49:34,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=473, Unknown=5, NotChecked=90, Total=650 [2025-03-17 13:49:34,420 INFO L87 Difference]: Start difference. First operand 597 states and 676 transitions. Second operand has 21 states, 18 states have (on average 8.0) internal successors, (144), 21 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-03-17 13:49:36,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:36,197 INFO L93 Difference]: Finished difference Result 596 states and 675 transitions. [2025-03-17 13:49:36,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 13:49:36,197 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.0) internal successors, (144), 21 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 90 [2025-03-17 13:49:36,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:36,199 INFO L225 Difference]: With dead ends: 596 [2025-03-17 13:49:36,199 INFO L226 Difference]: Without dead ends: 596 [2025-03-17 13:49:36,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=682, Unknown=5, NotChecked=110, Total=930 [2025-03-17 13:49:36,199 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 459 mSDsluCounter, 3918 mSDsCounter, 0 mSdLazyCounter, 4872 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 4222 SdHoareTripleChecker+Invalid, 4888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 4872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:36,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 4222 Invalid, 4888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 4872 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 13:49:36,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-17 13:49:36,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 587. [2025-03-17 13:49:36,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 420 states have (on average 1.5642857142857143) internal successors, (657), 582 states have internal predecessors, (657), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:49:36,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 663 transitions. [2025-03-17 13:49:36,205 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 663 transitions. Word has length 90 [2025-03-17 13:49:36,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:36,205 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 663 transitions. [2025-03-17 13:49:36,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.0) internal successors, (144), 21 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-03-17 13:49:36,205 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 663 transitions. [2025-03-17 13:49:36,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 13:49:36,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:36,206 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-03-17 13:49:36,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 13:49:36,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:49:36,406 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr212REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:36,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:36,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1528195976, now seen corresponding path program 1 times [2025-03-17 13:49:36,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:36,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860030589] [2025-03-17 13:49:36,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:36,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:36,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 13:49:36,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 13:49:36,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:36,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:36,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:36,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:36,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860030589] [2025-03-17 13:49:36,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860030589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:36,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:36,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 13:49:36,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914981144] [2025-03-17 13:49:36,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:36,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 13:49:36,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:36,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 13:49:36,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-17 13:49:36,733 INFO L87 Difference]: Start difference. First operand 587 states and 663 transitions. Second operand has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:49:37,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:37,517 INFO L93 Difference]: Finished difference Result 600 states and 679 transitions. [2025-03-17 13:49:37,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:49:37,519 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2025-03-17 13:49:37,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:37,521 INFO L225 Difference]: With dead ends: 600 [2025-03-17 13:49:37,521 INFO L226 Difference]: Without dead ends: 600 [2025-03-17 13:49:37,521 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-03-17 13:49:37,522 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 497 mSDsluCounter, 2326 mSDsCounter, 0 mSdLazyCounter, 2263 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 2630 SdHoareTripleChecker+Invalid, 2277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:37,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 2630 Invalid, 2277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2263 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 13:49:37,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-17 13:49:37,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 599. [2025-03-17 13:49:37,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 431 states have (on average 1.554524361948956) internal successors, (670), 593 states have internal predecessors, (670), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 13:49:37,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 679 transitions. [2025-03-17 13:49:37,529 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 679 transitions. Word has length 92 [2025-03-17 13:49:37,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:37,529 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 679 transitions. [2025-03-17 13:49:37,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:49:37,530 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 679 transitions. [2025-03-17 13:49:37,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 13:49:37,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:37,530 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-03-17 13:49:37,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 13:49:37,530 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr213REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:37,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:37,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1528195977, now seen corresponding path program 1 times [2025-03-17 13:49:37,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:37,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809192524] [2025-03-17 13:49:37,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:37,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:37,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 13:49:37,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 13:49:37,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:37,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:37,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:37,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:37,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809192524] [2025-03-17 13:49:37,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809192524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:37,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:37,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 13:49:37,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897456395] [2025-03-17 13:49:37,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:37,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 13:49:37,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:37,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 13:49:37,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 13:49:37,982 INFO L87 Difference]: Start difference. First operand 599 states and 679 transitions. Second operand has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:49:38,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:38,983 INFO L93 Difference]: Finished difference Result 599 states and 678 transitions. [2025-03-17 13:49:38,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 13:49:38,984 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2025-03-17 13:49:38,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:38,985 INFO L225 Difference]: With dead ends: 599 [2025-03-17 13:49:38,985 INFO L226 Difference]: Without dead ends: 599 [2025-03-17 13:49:38,985 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-03-17 13:49:38,986 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 474 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 2364 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 2376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:38,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1965 Invalid, 2376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2364 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 13:49:38,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-17 13:49:38,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2025-03-17 13:49:38,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 431 states have (on average 1.5522041763341068) internal successors, (669), 593 states have internal predecessors, (669), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 13:49:38,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 678 transitions. [2025-03-17 13:49:38,993 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 678 transitions. Word has length 92 [2025-03-17 13:49:38,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:38,993 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 678 transitions. [2025-03-17 13:49:38,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:49:38,993 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 678 transitions. [2025-03-17 13:49:38,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 13:49:38,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:38,994 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:49:38,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 13:49:38,994 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr212REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:38,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:38,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1197821112, now seen corresponding path program 1 times [2025-03-17 13:49:38,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:38,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041494306] [2025-03-17 13:49:38,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:38,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:39,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 13:49:39,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 13:49:39,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:39,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:39,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:39,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:39,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041494306] [2025-03-17 13:49:39,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041494306] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:39,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788403115] [2025-03-17 13:49:39,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:39,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:49:39,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:49:39,365 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:49:39,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 13:49:39,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 13:49:39,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 13:49:39,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:39,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:39,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 13:49:39,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:49:39,523 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-03-17 13:49:39,589 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:49:39,589 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-03-17 13:49:39,594 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-03-17 13:49:39,646 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:39,647 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-03-17 13:49:39,677 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:39,677 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-03-17 13:49:39,718 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:39,719 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-03-17 13:49:39,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-17 13:49:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:39,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:49:39,741 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1301 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1301) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-03-17 13:49:39,776 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1301 (Array Int Int)) (v_ArrVal_1300 (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_1300))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1301)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-17 13:49:39,825 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2025-03-17 13:49:39,825 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-03-17 13:49:39,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788403115] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:39,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:49:39,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 18 [2025-03-17 13:49:39,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930809395] [2025-03-17 13:49:39,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:49:39,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 13:49:39,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:39,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 13:49:39,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=373, Unknown=25, NotChecked=82, Total=552 [2025-03-17 13:49:39,859 INFO L87 Difference]: Start difference. First operand 599 states and 678 transitions. Second operand has 19 states, 17 states have (on average 8.352941176470589) internal successors, (142), 19 states have internal predecessors, (142), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:49:40,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:40,910 INFO L93 Difference]: Finished difference Result 598 states and 677 transitions. [2025-03-17 13:49:40,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 13:49:40,911 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.352941176470589) internal successors, (142), 19 states have internal predecessors, (142), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 93 [2025-03-17 13:49:40,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:40,912 INFO L225 Difference]: With dead ends: 598 [2025-03-17 13:49:40,912 INFO L226 Difference]: Without dead ends: 598 [2025-03-17 13:49:40,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=709, Unknown=25, NotChecked=114, Total=992 [2025-03-17 13:49:40,913 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 461 mSDsluCounter, 3449 mSDsCounter, 0 mSdLazyCounter, 3221 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 3753 SdHoareTripleChecker+Invalid, 3234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:40,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 3753 Invalid, 3234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3221 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 13:49:40,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-03-17 13:49:40,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2025-03-17 13:49:40,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 431 states have (on average 1.5498839907192576) internal successors, (668), 592 states have internal predecessors, (668), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 13:49:40,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 677 transitions. [2025-03-17 13:49:40,918 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 677 transitions. Word has length 93 [2025-03-17 13:49:40,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:40,918 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 677 transitions. [2025-03-17 13:49:40,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.352941176470589) internal successors, (142), 19 states have internal predecessors, (142), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 13:49:40,918 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 677 transitions. [2025-03-17 13:49:40,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 13:49:40,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:40,919 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:49:40,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 13:49:41,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-17 13:49:41,120 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr213REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:41,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:41,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1197821111, now seen corresponding path program 1 times [2025-03-17 13:49:41,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:41,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430734848] [2025-03-17 13:49:41,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:41,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:41,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 13:49:41,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 13:49:41,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:41,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:41,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:41,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:41,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430734848] [2025-03-17 13:49:41,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430734848] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:41,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8759310] [2025-03-17 13:49:41,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:41,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:49:41,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:49:41,598 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:49:41,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 13:49:41,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 13:49:41,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 13:49:41,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:41,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:41,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-17 13:49:41,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:49:41,759 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-03-17 13:49:41,825 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-03-17 13:49:41,846 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:49:41,847 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-03-17 13:49:41,854 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-03-17 13:49:41,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-03-17 13:49:41,904 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-03-17 13:49:41,907 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-03-17 13:49:42,019 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:42,019 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-03-17 13:49:42,024 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-03-17 13:49:42,067 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:42,067 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-03-17 13:49:42,072 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-03-17 13:49:42,112 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:42,112 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-03-17 13:49:42,118 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-03-17 13:49:42,131 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-03-17 13:49:42,134 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-03-17 13:49:42,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:42,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:49:42,176 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1456 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1455 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1456) |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~mem54#1.base| v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-17 13:49:42,227 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1454) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1453))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1454) .cse1 v_ArrVal_1456) |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-03-17 13:49:42,241 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_1456 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1454) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1453))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1454) .cse2 v_ArrVal_1456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2025-03-17 13:49:42,284 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1461))) (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~mem51#1.base| v_ArrVal_1462) .cse0 v_ArrVal_1454) (select (select (store .cse1 .cse0 v_ArrVal_1453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1456))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1461))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1453))) (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~mem51#1.base| v_ArrVal_1462) .cse3 v_ArrVal_1454) .cse4 v_ArrVal_1456) |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-03-17 13:49:42,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8759310] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:42,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:49:42,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 17 [2025-03-17 13:49:42,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039928470] [2025-03-17 13:49:42,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:49:42,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 13:49:42,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:42,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 13:49:42,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=342, Unknown=15, NotChecked=164, Total=600 [2025-03-17 13:49:42,289 INFO L87 Difference]: Start difference. First operand 598 states and 677 transitions. Second operand has 18 states, 16 states have (on average 8.8125) internal successors, (141), 18 states have internal predecessors, (141), 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-03-17 13:49:44,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:44,082 INFO L93 Difference]: Finished difference Result 605 states and 684 transitions. [2025-03-17 13:49:44,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:49:44,083 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.8125) internal successors, (141), 18 states have internal predecessors, (141), 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 93 [2025-03-17 13:49:44,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:44,084 INFO L225 Difference]: With dead ends: 605 [2025-03-17 13:49:44,084 INFO L226 Difference]: Without dead ends: 605 [2025-03-17 13:49:44,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=574, Unknown=15, NotChecked=212, Total=930 [2025-03-17 13:49:44,084 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 457 mSDsluCounter, 3061 mSDsCounter, 0 mSdLazyCounter, 4088 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 3367 SdHoareTripleChecker+Invalid, 4102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 4088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:44,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 3367 Invalid, 4102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 4088 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 13:49:44,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-03-17 13:49:44,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 590. [2025-03-17 13:49:44,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 424 states have (on average 1.5566037735849056) internal successors, (660), 584 states have internal predecessors, (660), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:49:44,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 666 transitions. [2025-03-17 13:49:44,090 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 666 transitions. Word has length 93 [2025-03-17 13:49:44,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:44,090 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 666 transitions. [2025-03-17 13:49:44,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.8125) internal successors, (141), 18 states have internal predecessors, (141), 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-03-17 13:49:44,090 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 666 transitions. [2025-03-17 13:49:44,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 13:49:44,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:44,091 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-03-17 13:49:44,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 13:49:44,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:49:44,292 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr208REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:44,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:44,292 INFO L85 PathProgramCache]: Analyzing trace with hash -166591679, now seen corresponding path program 1 times [2025-03-17 13:49:44,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:44,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831706890] [2025-03-17 13:49:44,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:44,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:44,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 13:49:44,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 13:49:44,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:44,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:44,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:44,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:44,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831706890] [2025-03-17 13:49:44,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831706890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:44,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:44,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 13:49:44,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687782995] [2025-03-17 13:49:44,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:44,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 13:49:44,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:44,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 13:49:44,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-17 13:49:44,619 INFO L87 Difference]: Start difference. First operand 590 states and 666 transitions. Second operand has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:49:45,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:45,651 INFO L93 Difference]: Finished difference Result 609 states and 688 transitions. [2025-03-17 13:49:45,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 13:49:45,651 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2025-03-17 13:49:45,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:45,653 INFO L225 Difference]: With dead ends: 609 [2025-03-17 13:49:45,653 INFO L226 Difference]: Without dead ends: 609 [2025-03-17 13:49:45,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-03-17 13:49:45,653 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 494 mSDsluCounter, 3173 mSDsCounter, 0 mSdLazyCounter, 3003 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 3476 SdHoareTripleChecker+Invalid, 3016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:45,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 3476 Invalid, 3016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3003 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 13:49:45,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-03-17 13:49:45,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2025-03-17 13:49:45,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 438 states have (on average 1.54337899543379) internal successors, (676), 598 states have internal predecessors, (676), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 13:49:45,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 683 transitions. [2025-03-17 13:49:45,659 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 683 transitions. Word has length 95 [2025-03-17 13:49:45,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:45,659 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 683 transitions. [2025-03-17 13:49:45,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:49:45,659 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 683 transitions. [2025-03-17 13:49:45,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 13:49:45,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:45,660 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-03-17 13:49:45,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 13:49:45,660 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr209REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:45,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:45,660 INFO L85 PathProgramCache]: Analyzing trace with hash -166591678, now seen corresponding path program 1 times [2025-03-17 13:49:45,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:45,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450203913] [2025-03-17 13:49:45,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:45,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:45,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 13:49:45,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 13:49:45,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:45,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:46,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:46,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:46,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450203913] [2025-03-17 13:49:46,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450203913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:46,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:46,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 13:49:46,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478451002] [2025-03-17 13:49:46,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:46,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 13:49:46,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:46,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 13:49:46,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-17 13:49:46,141 INFO L87 Difference]: Start difference. First operand 605 states and 683 transitions. Second operand has 13 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:49:46,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:46,831 INFO L93 Difference]: Finished difference Result 608 states and 687 transitions. [2025-03-17 13:49:46,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 13:49:46,831 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2025-03-17 13:49:46,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:46,832 INFO L225 Difference]: With dead ends: 608 [2025-03-17 13:49:46,832 INFO L226 Difference]: Without dead ends: 608 [2025-03-17 13:49:46,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-03-17 13:49:46,833 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 493 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:46,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 1546 Invalid, 1739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 13:49:46,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-03-17 13:49:46,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 605. [2025-03-17 13:49:46,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 438 states have (on average 1.5410958904109588) internal successors, (675), 598 states have internal predecessors, (675), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 13:49:46,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 682 transitions. [2025-03-17 13:49:46,838 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 682 transitions. Word has length 95 [2025-03-17 13:49:46,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:46,838 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 682 transitions. [2025-03-17 13:49:46,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:49:46,838 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 682 transitions. [2025-03-17 13:49:46,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 13:49:46,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:46,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:49:46,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 13:49:46,838 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr208REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:46,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:46,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1700027519, now seen corresponding path program 1 times [2025-03-17 13:49:46,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:46,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425165636] [2025-03-17 13:49:46,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:46,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:46,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 13:49:46,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 13:49:46,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:46,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:47,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:47,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:47,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425165636] [2025-03-17 13:49:47,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425165636] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:47,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816564545] [2025-03-17 13:49:47,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:47,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:49:47,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:49:47,205 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:49:47,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 13:49:47,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 13:49:47,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 13:49:47,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:47,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:47,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 13:49:47,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:49:47,376 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-03-17 13:49:47,430 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:49:47,430 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-03-17 13:49:47,433 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-03-17 13:49:47,489 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:47,489 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-03-17 13:49:47,516 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:47,516 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-03-17 13:49:47,544 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:47,544 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-03-17 13:49:47,579 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:47,579 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-03-17 13:49:47,586 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-03-17 13:49:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:47,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:49:47,623 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1761 (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_1761) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-03-17 13:49:47,628 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1760))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1761)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-17 13:49:47,631 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1761)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-17 13:49:47,637 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1761 (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~mem53#1.base| v_ArrVal_1759))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1761)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-17 13:49:47,640 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1761 (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| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1761)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-17 13:49:47,669 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2025-03-17 13:49:47,670 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-03-17 13:49:47,675 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#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~mem51#1.base| v_ArrVal_1764))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1761)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2025-03-17 13:49:47,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816564545] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:47,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:49:47,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 21 [2025-03-17 13:49:47,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904742694] [2025-03-17 13:49:47,676 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:49:47,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 13:49:47,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:47,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 13:49:47,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=426, Unknown=18, NotChecked=282, Total=812 [2025-03-17 13:49:47,677 INFO L87 Difference]: Start difference. First operand 605 states and 682 transitions. Second operand has 22 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 22 states have internal predecessors, (148), 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-03-17 13:49:48,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:48,438 INFO L93 Difference]: Finished difference Result 607 states and 686 transitions. [2025-03-17 13:49:48,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 13:49:48,438 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 22 states have internal predecessors, (148), 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 96 [2025-03-17 13:49:48,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:48,440 INFO L225 Difference]: With dead ends: 607 [2025-03-17 13:49:48,440 INFO L226 Difference]: Without dead ends: 607 [2025-03-17 13:49:48,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=834, Unknown=23, NotChecked=390, Total=1406 [2025-03-17 13:49:48,441 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 459 mSDsluCounter, 2009 mSDsCounter, 0 mSdLazyCounter, 2027 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 2312 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:48,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 2312 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2027 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 13:49:48,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-17 13:49:48,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 604. [2025-03-17 13:49:48,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 438 states have (on average 1.538812785388128) internal successors, (674), 597 states have internal predecessors, (674), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 13:49:48,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 681 transitions. [2025-03-17 13:49:48,446 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 681 transitions. Word has length 96 [2025-03-17 13:49:48,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:48,446 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 681 transitions. [2025-03-17 13:49:48,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 22 states have internal predecessors, (148), 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-03-17 13:49:48,447 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 681 transitions. [2025-03-17 13:49:48,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 13:49:48,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:48,447 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:49:48,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 13:49:48,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:49:48,648 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr209REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:48,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:48,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1700027518, now seen corresponding path program 1 times [2025-03-17 13:49:48,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:48,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937824560] [2025-03-17 13:49:48,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:48,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:48,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 13:49:48,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 13:49:48,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:48,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:49,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:49,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:49,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937824560] [2025-03-17 13:49:49,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937824560] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:49,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137707657] [2025-03-17 13:49:49,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:49,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:49:49,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:49:49,229 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:49:49,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 13:49:49,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 13:49:49,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 13:49:49,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:49,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:49,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 13:49:49,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:49:49,394 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-03-17 13:49:49,453 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:49:49,454 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-03-17 13:49:49,472 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-03-17 13:49:49,475 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-03-17 13:49:49,567 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:49,567 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-03-17 13:49:49,569 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-03-17 13:49:49,619 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:49,619 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-03-17 13:49:49,621 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-03-17 13:49:49,659 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:49,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2025-03-17 13:49:49,663 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-03-17 13:49:49,701 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:49,701 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-03-17 13:49:49,706 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-03-17 13:49:49,722 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-03-17 13:49:49,725 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-03-17 13:49:49,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:49,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:49:49,836 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_1928 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-03-17 13:49:49,850 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1928 (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~mem54#1.base| v_ArrVal_1927) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 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))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1926))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1927) .cse1 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-03-17 13:49:49,916 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_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 ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1925))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1926))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1924) .cse0 v_ArrVal_1927) .cse1 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((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))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1925))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1924) .cse5 v_ArrVal_1927) (select (select (store .cse6 .cse5 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1928))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2025-03-17 13:49:50,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:49:50,139 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 300 treesize of output 304 [2025-03-17 13:49:50,271 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |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_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#1.base| (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1934))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1925)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1926)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1929)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_prenex_14 (Array Int Int)) (v_prenex_13 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_11))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store .cse7 .cse4 v_prenex_15))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_16) .cse4 v_prenex_17) .cse5 v_prenex_13) (select (select (store .cse6 .cse5 v_prenex_14) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_12))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1934 (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))) (< (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1934))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_1925))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1935) .cse8 v_ArrVal_1924) .cse9 v_ArrVal_1927) (select (select (store .cse10 .cse9 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1928))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ 21 |c_ULTIMATE.start_main_#t~mem51#1.offset|))))) is different from false [2025-03-17 13:49:50,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137707657] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:50,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:49:50,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2025-03-17 13:49:50,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981433189] [2025-03-17 13:49:50,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:49:50,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 13:49:50,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:50,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 13:49:50,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=729, Unknown=29, NotChecked=236, Total=1122 [2025-03-17 13:49:50,276 INFO L87 Difference]: Start difference. First operand 604 states and 681 transitions. Second operand has 25 states, 22 states have (on average 7.090909090909091) internal successors, (156), 25 states have internal predecessors, (156), 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-03-17 13:49:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:51,805 INFO L93 Difference]: Finished difference Result 606 states and 685 transitions. [2025-03-17 13:49:51,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 13:49:51,805 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.090909090909091) internal successors, (156), 25 states have internal predecessors, (156), 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 96 [2025-03-17 13:49:51,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:51,807 INFO L225 Difference]: With dead ends: 606 [2025-03-17 13:49:51,807 INFO L226 Difference]: Without dead ends: 606 [2025-03-17 13:49:51,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=210, Invalid=1109, Unknown=29, NotChecked=292, Total=1640 [2025-03-17 13:49:51,807 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 458 mSDsluCounter, 2812 mSDsCounter, 0 mSdLazyCounter, 3378 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 3114 SdHoareTripleChecker+Invalid, 3394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:51,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 3114 Invalid, 3394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3378 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 13:49:51,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-03-17 13:49:51,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 588. [2025-03-17 13:49:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 424 states have (on average 1.5518867924528301) internal successors, (658), 582 states have internal predecessors, (658), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:49:51,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 664 transitions. [2025-03-17 13:49:51,813 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 664 transitions. Word has length 96 [2025-03-17 13:49:51,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:51,813 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 664 transitions. [2025-03-17 13:49:51,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.090909090909091) internal successors, (156), 25 states have internal predecessors, (156), 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-03-17 13:49:51,813 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 664 transitions. [2025-03-17 13:49:51,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 13:49:51,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:51,813 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-03-17 13:49:51,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 13:49:52,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-17 13:49:52,014 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr204REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:52,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:52,015 INFO L85 PathProgramCache]: Analyzing trace with hash -877514693, now seen corresponding path program 1 times [2025-03-17 13:49:52,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:52,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352034940] [2025-03-17 13:49:52,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:52,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:52,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 13:49:52,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 13:49:52,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:52,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:52,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:52,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352034940] [2025-03-17 13:49:52,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352034940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:52,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:52,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 13:49:52,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892344730] [2025-03-17 13:49:52,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:52,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 13:49:52,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:52,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 13:49:52,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-17 13:49:52,588 INFO L87 Difference]: Start difference. First operand 588 states and 664 transitions. Second operand has 14 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 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-03-17 13:49:53,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:53,519 INFO L93 Difference]: Finished difference Result 611 states and 690 transitions. [2025-03-17 13:49:53,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 13:49:53,520 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 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 99 [2025-03-17 13:49:53,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:53,521 INFO L225 Difference]: With dead ends: 611 [2025-03-17 13:49:53,521 INFO L226 Difference]: Without dead ends: 611 [2025-03-17 13:49:53,521 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-03-17 13:49:53,522 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 480 mSDsluCounter, 2279 mSDsCounter, 0 mSdLazyCounter, 2256 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 2584 SdHoareTripleChecker+Invalid, 2271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:53,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 2584 Invalid, 2271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2256 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 13:49:53,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-03-17 13:49:53,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 607. [2025-03-17 13:49:53,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 442 states have (on average 1.5339366515837105) internal successors, (678), 600 states have internal predecessors, (678), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 13:49:53,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 685 transitions. [2025-03-17 13:49:53,527 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 685 transitions. Word has length 99 [2025-03-17 13:49:53,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:53,527 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 685 transitions. [2025-03-17 13:49:53,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 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-03-17 13:49:53,527 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 685 transitions. [2025-03-17 13:49:53,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 13:49:53,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:53,527 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-03-17 13:49:53,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 13:49:53,528 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr205REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:53,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:53,528 INFO L85 PathProgramCache]: Analyzing trace with hash -877514692, now seen corresponding path program 1 times [2025-03-17 13:49:53,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:53,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233323707] [2025-03-17 13:49:53,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:53,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:53,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 13:49:53,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 13:49:53,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:53,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:54,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:54,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233323707] [2025-03-17 13:49:54,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233323707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:49:54,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:49:54,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 13:49:54,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218904850] [2025-03-17 13:49:54,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:49:54,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 13:49:54,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:54,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 13:49:54,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-03-17 13:49:54,330 INFO L87 Difference]: Start difference. First operand 607 states and 685 transitions. Second operand has 18 states, 16 states have (on average 6.0625) internal successors, (97), 17 states have internal predecessors, (97), 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-03-17 13:49:55,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:55,467 INFO L93 Difference]: Finished difference Result 610 states and 689 transitions. [2025-03-17 13:49:55,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 13:49:55,467 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.0625) internal successors, (97), 17 states have internal predecessors, (97), 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 99 [2025-03-17 13:49:55,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:55,468 INFO L225 Difference]: With dead ends: 610 [2025-03-17 13:49:55,468 INFO L226 Difference]: Without dead ends: 610 [2025-03-17 13:49:55,469 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-03-17 13:49:55,469 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 480 mSDsluCounter, 1658 mSDsCounter, 0 mSdLazyCounter, 2405 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 2424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:55,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1961 Invalid, 2424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2405 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 13:49:55,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-03-17 13:49:55,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 607. [2025-03-17 13:49:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 442 states have (on average 1.5316742081447965) internal successors, (677), 600 states have internal predecessors, (677), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 13:49:55,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 684 transitions. [2025-03-17 13:49:55,475 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 684 transitions. Word has length 99 [2025-03-17 13:49:55,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:55,475 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 684 transitions. [2025-03-17 13:49:55,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.0625) internal successors, (97), 17 states have internal predecessors, (97), 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-03-17 13:49:55,475 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 684 transitions. [2025-03-17 13:49:55,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 13:49:55,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:55,476 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] [2025-03-17 13:49:55,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 13:49:55,476 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr204REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:55,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:55,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1308733563, now seen corresponding path program 1 times [2025-03-17 13:49:55,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:55,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314268301] [2025-03-17 13:49:55,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:55,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:55,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 13:49:55,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 13:49:55,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:55,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:55,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:55,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:55,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314268301] [2025-03-17 13:49:55,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314268301] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:55,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515191214] [2025-03-17 13:49:55,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:55,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:49:55,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:49:55,969 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:49:55,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 13:49:56,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 13:49:56,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 13:49:56,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:56,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:56,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 13:49:56,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:49:56,191 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-03-17 13:49:56,267 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:49:56,267 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-03-17 13:49:56,270 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-03-17 13:49:56,331 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:56,331 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-03-17 13:49:56,366 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:56,367 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-03-17 13:49:56,403 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:56,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 13:49:56,435 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:56,436 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-03-17 13:49:56,473 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:56,473 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-03-17 13:49:56,482 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-03-17 13:49:56,496 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 13:49:56,497 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-03-17 13:49:56,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:56,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:49:57,015 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2025-03-17 13:49:57,015 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-03-17 13:49:57,025 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2264 (Array Int Int)) (v_ArrVal_2271 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2271))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2264)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2265)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2266)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2267)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem51#1.base|)) is different from false [2025-03-17 13:49:57,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515191214] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:57,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:49:57,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 23 [2025-03-17 13:49:57,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702277802] [2025-03-17 13:49:57,026 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:49:57,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 13:49:57,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:49:57,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 13:49:57,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=935, Unknown=41, NotChecked=64, Total=1190 [2025-03-17 13:49:57,027 INFO L87 Difference]: Start difference. First operand 607 states and 684 transitions. Second operand has 24 states, 21 states have (on average 7.333333333333333) internal successors, (154), 24 states have internal predecessors, (154), 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-03-17 13:49:58,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:49:58,122 INFO L93 Difference]: Finished difference Result 609 states and 688 transitions. [2025-03-17 13:49:58,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 13:49:58,123 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.333333333333333) internal successors, (154), 24 states have internal predecessors, (154), 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 100 [2025-03-17 13:49:58,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:49:58,124 INFO L225 Difference]: With dead ends: 609 [2025-03-17 13:49:58,124 INFO L226 Difference]: Without dead ends: 609 [2025-03-17 13:49:58,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=272, Invalid=1583, Unknown=41, NotChecked=84, Total=1980 [2025-03-17 13:49:58,125 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 455 mSDsluCounter, 2589 mSDsCounter, 0 mSdLazyCounter, 2496 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 2891 SdHoareTripleChecker+Invalid, 2515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:49:58,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 2891 Invalid, 2515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2496 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 13:49:58,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-03-17 13:49:58,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 606. [2025-03-17 13:49:58,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 442 states have (on average 1.5294117647058822) internal successors, (676), 599 states have internal predecessors, (676), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 13:49:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 683 transitions. [2025-03-17 13:49:58,148 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 683 transitions. Word has length 100 [2025-03-17 13:49:58,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:49:58,151 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 683 transitions. [2025-03-17 13:49:58,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.333333333333333) internal successors, (154), 24 states have internal predecessors, (154), 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-03-17 13:49:58,151 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 683 transitions. [2025-03-17 13:49:58,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 13:49:58,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:49:58,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:49:58,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 13:49:58,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:49:58,352 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr205REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:49:58,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:49:58,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1308733564, now seen corresponding path program 1 times [2025-03-17 13:49:58,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:49:58,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256691947] [2025-03-17 13:49:58,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:58,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:49:58,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 13:49:58,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 13:49:58,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:58,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:59,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:49:59,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:49:59,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256691947] [2025-03-17 13:49:59,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256691947] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:49:59,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256292312] [2025-03-17 13:49:59,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:49:59,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:49:59,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:49:59,127 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:49:59,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 13:49:59,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 13:49:59,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 13:49:59,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:49:59,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:49:59,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-17 13:49:59,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:49:59,333 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-03-17 13:49:59,401 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-03-17 13:49:59,416 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 13:49:59,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 13:49:59,448 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-03-17 13:49:59,451 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-03-17 13:49:59,537 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 33 treesize of output 15 [2025-03-17 13:49:59,540 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-03-17 13:49:59,676 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:59,676 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-03-17 13:49:59,682 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-03-17 13:49:59,757 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:59,757 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-03-17 13:49:59,764 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-03-17 13:49:59,832 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:59,833 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-03-17 13:49:59,837 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-03-17 13:49:59,909 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:59,909 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-03-17 13:49:59,913 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-03-17 13:49:59,988 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 13:49:59,988 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-03-17 13:49:59,991 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-03-17 13:50:00,013 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-03-17 13:50:00,018 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-03-17 13:50:00,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 13:50:00,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 13:50:00,088 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-17 13:50:00,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-17 13:50:00,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:50:00,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:50:00,504 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 (or (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0))) (forall ((v_ArrVal_2455 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (v_ArrVal_2453 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2453) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)))) (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int) (v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2455 (Array Int Int)) (v_ArrVal_2454 (Array Int Int)) (v_ArrVal_2453 (Array Int Int))) (or (forall ((v_ArrVal_2457 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2454))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2453) .cse2 v_ArrVal_2455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2457) (select (select (store .cse3 .cse2 v_ArrVal_2456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0))))))) is different from false [2025-03-17 13:50:00,859 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2455 (Array Int Int)) (v_ArrVal_2454 (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 ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2450))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2451))) (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~mem53#1.base| v_ArrVal_2449) .cse0 v_ArrVal_2452) .cse1 v_ArrVal_2453) (select (select (store .cse2 .cse1 v_ArrVal_2454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2455))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0)))) (forall ((v_ArrVal_2449 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int) (v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2455 (Array Int Int)) (v_ArrVal_2454 (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))) (or (forall ((v_ArrVal_2457 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2450))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2451))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2454))) (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~mem53#1.base| v_ArrVal_2449) .cse5 v_ArrVal_2452) .cse6 v_ArrVal_2453) .cse7 v_ArrVal_2455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2457) (select (select (store .cse8 .cse7 v_ArrVal_2456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0)))))) is different from false [2025-03-17 13:50:00,881 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_2455 (Array Int Int)) (v_ArrVal_2454 (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_2450))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2451))) (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_2449) .cse1 v_ArrVal_2452) .cse2 v_ArrVal_2453) (select (select (store .cse3 .cse2 v_ArrVal_2454) |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~malloc58#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0)))) (forall ((v_ArrVal_2449 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int) (v_ArrVal_2456 (Array Int Int)) (v_ArrVal_2455 (Array Int Int)) (v_ArrVal_2454 (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))) (or (forall ((v_ArrVal_2457 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2450))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2451))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2454))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2449) .cse6 v_ArrVal_2452) .cse7 v_ArrVal_2453) .cse8 v_ArrVal_2455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2457) (select (select (store .cse9 .cse8 v_ArrVal_2456) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0))))))) is different from false [2025-03-17 13:50:05,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256292312] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:50:05,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 13:50:05,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2025-03-17 13:50:05,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366709839] [2025-03-17 13:50:05,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 13:50:05,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 13:50:05,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:50:05,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 13:50:05,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1296, Unknown=37, NotChecked=228, Total=1722 [2025-03-17 13:50:05,655 INFO L87 Difference]: Start difference. First operand 606 states and 683 transitions. Second operand has 30 states, 27 states have (on average 6.074074074074074) internal successors, (164), 29 states have internal predecessors, (164), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 13:50:34,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:50:34,188 INFO L93 Difference]: Finished difference Result 608 states and 687 transitions. [2025-03-17 13:50:34,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 13:50:34,189 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 6.074074074074074) internal successors, (164), 29 states have internal predecessors, (164), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 100 [2025-03-17 13:50:34,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:50:34,190 INFO L225 Difference]: With dead ends: 608 [2025-03-17 13:50:34,190 INFO L226 Difference]: Without dead ends: 608 [2025-03-17 13:50:34,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=274, Invalid=2053, Unknown=37, NotChecked=288, Total=2652 [2025-03-17 13:50:34,191 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 443 mSDsluCounter, 4308 mSDsCounter, 0 mSdLazyCounter, 6076 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 4609 SdHoareTripleChecker+Invalid, 6097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 6076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.6s IncrementalHoareTripleChecker+Time [2025-03-17 13:50:34,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 4609 Invalid, 6097 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 6076 Invalid, 0 Unknown, 0 Unchecked, 26.6s Time] [2025-03-17 13:50:34,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-03-17 13:50:34,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 586. [2025-03-17 13:50:34,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 424 states have (on average 1.5471698113207548) internal successors, (656), 580 states have internal predecessors, (656), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:50:34,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 662 transitions. [2025-03-17 13:50:34,196 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 662 transitions. Word has length 100 [2025-03-17 13:50:34,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:50:34,196 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 662 transitions. [2025-03-17 13:50:34,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 6.074074074074074) internal successors, (164), 29 states have internal predecessors, (164), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 13:50:34,196 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 662 transitions. [2025-03-17 13:50:34,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 13:50:34,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:50:34,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:50:34,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 13:50:34,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-17 13:50:34,397 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr200REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-17 13:50:34,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:50:34,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1426121599, now seen corresponding path program 1 times [2025-03-17 13:50:34,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:50:34,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785474376] [2025-03-17 13:50:34,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:50:34,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:50:34,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 13:50:34,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 13:50:34,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:50:34,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:50:35,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:50:35,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:50:35,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785474376] [2025-03-17 13:50:35,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785474376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:50:35,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:50:35,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 13:50:35,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034669598] [2025-03-17 13:50:35,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:50:35,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 13:50:35,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:50:35,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 13:50:35,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-17 13:50:35,736 INFO L87 Difference]: Start difference. First operand 586 states and 662 transitions. Second operand has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 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)