./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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_JEN_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-?-798a7b3-m [2025-03-04 09:25:17,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:25:17,787 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:25:17,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:25:17,793 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:25:17,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:25:17,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:25:17,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:25:17,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:25:17,807 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:25:17,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:25:17,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:25:17,807 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:25:17,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:25:17,807 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:25:17,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:25:17,808 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:25:17,808 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:25:17,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:25:17,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:25:17,808 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:25:17,808 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:25:17,808 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:25:17,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:25:17,808 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:25:17,808 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:25:17,808 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:25:17,808 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:25:17,808 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:25:17,808 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:25:17,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:25:17,808 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:25:17,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:25:17,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:25:17,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:25:17,809 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:25:17,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:25:17,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:25:17,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:25:17,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:25:17,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:25:17,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:25:17,809 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-04 09:25:18,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:25:18,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:25:18,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:25:18,044 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:25:18,044 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:25:18,044 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test1-1.i [2025-03-04 09:25:19,171 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/785bc5fe9/e51f43fb82e84d75a71ee1395bf5aa65/FLAG62e7f3e20 [2025-03-04 09:25:19,467 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:25:19,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test1-1.i [2025-03-04 09:25:19,484 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/785bc5fe9/e51f43fb82e84d75a71ee1395bf5aa65/FLAG62e7f3e20 [2025-03-04 09:25:19,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/785bc5fe9/e51f43fb82e84d75a71ee1395bf5aa65 [2025-03-04 09:25:19,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:25:19,748 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:25:19,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:25:19,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:25:19,752 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:25:19,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:25:19" (1/1) ... [2025-03-04 09:25:19,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a9e004 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:19, skipping insertion in model container [2025-03-04 09:25:19,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:25:19" (1/1) ... [2025-03-04 09:25:19,788 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:25:20,045 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-04 09:25:20,075 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-04 09:25:20,079 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-04 09:25:20,082 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-04 09:25:20,086 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-04 09:25:20,097 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-04 09:25:20,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:25:20,108 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:25:20,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:25:20,192 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:25:20,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:20 WrapperNode [2025-03-04 09:25:20,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:25:20,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:25:20,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:25:20,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:25:20,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:20" (1/1) ... [2025-03-04 09:25:20,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:20" (1/1) ... [2025-03-04 09:25:20,251 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 779 [2025-03-04 09:25:20,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:25:20,253 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:25:20,253 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:25:20,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:25:20,261 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:20" (1/1) ... [2025-03-04 09:25:20,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:20" (1/1) ... [2025-03-04 09:25:20,266 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:20" (1/1) ... [2025-03-04 09:25:20,307 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-04 09:25:20,310 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:20" (1/1) ... [2025-03-04 09:25:20,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:20" (1/1) ... [2025-03-04 09:25:20,336 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:20" (1/1) ... [2025-03-04 09:25:20,342 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:20" (1/1) ... [2025-03-04 09:25:20,343 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:20" (1/1) ... [2025-03-04 09:25:20,349 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:20" (1/1) ... [2025-03-04 09:25:20,355 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:25:20,356 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:25:20,356 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:25:20,356 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:25:20,357 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:20" (1/1) ... [2025-03-04 09:25:20,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:25:20,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:25:20,385 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-04 09:25:20,388 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-04 09:25:20,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 09:25:20,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 09:25:20,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 09:25:20,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 09:25:20,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 09:25:20,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 09:25:20,407 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 09:25:20,407 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 09:25:20,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 09:25:20,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:25:20,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 09:25:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 09:25:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 09:25:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 09:25:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 09:25:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:25:20,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:25:20,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:25:20,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:25:20,523 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:25:20,525 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:25:21,626 INFO L? ?]: Removed 762 outVars from TransFormulas that were not future-live. [2025-03-04 09:25:21,626 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:25:21,662 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:25:21,662 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 09:25:21,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:25:21 BoogieIcfgContainer [2025-03-04 09:25:21,662 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:25:21,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:25:21,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:25:21,667 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:25:21,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:25:19" (1/3) ... [2025-03-04 09:25:21,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63714048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:25:21, skipping insertion in model container [2025-03-04 09:25:21,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:20" (2/3) ... [2025-03-04 09:25:21,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63714048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:25:21, skipping insertion in model container [2025-03-04 09:25:21,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:25:21" (3/3) ... [2025-03-04 09:25:21,669 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test1-1.i [2025-03-04 09:25:21,678 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:25:21,679 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_nondet_test1-1.i that has 3 procedures, 737 locations, 1 initial locations, 19 loop locations, and 320 error locations. [2025-03-04 09:25:21,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:25:21,723 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;@59bb8f7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:25:21,723 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2025-03-04 09:25:21,726 INFO L276 IsEmpty]: Start isEmpty. Operand has 732 states, 410 states have (on average 2.0658536585365854) internal successors, (847), 727 states have internal predecessors, (847), 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-04 09:25:21,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 09:25:21,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:21,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:25:21,734 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-04 09:25:21,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:21,737 INFO L85 PathProgramCache]: Analyzing trace with hash 864568488, now seen corresponding path program 1 times [2025-03-04 09:25:21,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:21,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695834999] [2025-03-04 09:25:21,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:21,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:21,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:25:21,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:25:21,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:21,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:21,828 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-04 09:25:21,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:21,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695834999] [2025-03-04 09:25:21,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695834999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:21,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:21,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:25:21,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786568786] [2025-03-04 09:25:21,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:21,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:25:21,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:21,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:25:21,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:25:21,853 INFO L87 Difference]: Start difference. First operand has 732 states, 410 states have (on average 2.0658536585365854) internal successors, (847), 727 states have internal predecessors, (847), 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.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:21,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:21,911 INFO L93 Difference]: Finished difference Result 722 states and 810 transitions. [2025-03-04 09:25:21,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:25:21,917 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 09:25:21,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:21,928 INFO L225 Difference]: With dead ends: 722 [2025-03-04 09:25:21,928 INFO L226 Difference]: Without dead ends: 720 [2025-03-04 09:25:21,929 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-04 09:25:21,931 INFO L435 NwaCegarLoop]: 788 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, 788 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-04 09:25:21,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 788 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:25:21,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2025-03-04 09:25:21,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2025-03-04 09:25:21,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 404 states have (on average 1.9851485148514851) internal successors, (802), 715 states have internal predecessors, (802), 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-04 09:25:21,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 808 transitions. [2025-03-04 09:25:21,991 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 808 transitions. Word has length 5 [2025-03-04 09:25:21,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:21,991 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 808 transitions. [2025-03-04 09:25:21,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:21,992 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 808 transitions. [2025-03-04 09:25:21,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 09:25:21,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:21,993 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:25:21,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:25:21,993 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-04 09:25:21,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:21,994 INFO L85 PathProgramCache]: Analyzing trace with hash 864568519, now seen corresponding path program 1 times [2025-03-04 09:25:21,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:21,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448085266] [2025-03-04 09:25:21,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:21,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:22,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:25:22,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:25:22,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:22,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:22,068 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-04 09:25:22,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:22,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448085266] [2025-03-04 09:25:22,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448085266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:22,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:22,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:25:22,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174613892] [2025-03-04 09:25:22,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:22,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:25:22,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:22,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:25:22,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:25:22,070 INFO L87 Difference]: Start difference. First operand 720 states and 808 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:22,532 INFO L93 Difference]: Finished difference Result 672 states and 761 transitions. [2025-03-04 09:25:22,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:25:22,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 09:25:22,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:22,534 INFO L225 Difference]: With dead ends: 672 [2025-03-04 09:25:22,535 INFO L226 Difference]: Without dead ends: 672 [2025-03-04 09:25:22,535 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-04 09:25:22,535 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 674 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:22,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 436 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 09:25:22,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-04 09:25:22,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 671. [2025-03-04 09:25:22,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 404 states have (on average 1.863861386138614) internal successors, (753), 666 states have internal predecessors, (753), 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-04 09:25:22,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 759 transitions. [2025-03-04 09:25:22,562 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 759 transitions. Word has length 5 [2025-03-04 09:25:22,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:22,562 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 759 transitions. [2025-03-04 09:25:22,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:22,563 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 759 transitions. [2025-03-04 09:25:22,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 09:25:22,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:22,563 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:25:22,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:25:22,563 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-04 09:25:22,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:22,576 INFO L85 PathProgramCache]: Analyzing trace with hash 864568520, now seen corresponding path program 1 times [2025-03-04 09:25:22,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:22,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661324757] [2025-03-04 09:25:22,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:22,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:22,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:25:22,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:25:22,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:22,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:22,635 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-04 09:25:22,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:22,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661324757] [2025-03-04 09:25:22,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661324757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:22,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:22,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:25:22,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089284911] [2025-03-04 09:25:22,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:22,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:25:22,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:22,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:25:22,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:25:22,637 INFO L87 Difference]: Start difference. First operand 671 states and 759 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:23,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:23,023 INFO L93 Difference]: Finished difference Result 747 states and 841 transitions. [2025-03-04 09:25:23,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:25:23,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 09:25:23,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:23,026 INFO L225 Difference]: With dead ends: 747 [2025-03-04 09:25:23,026 INFO L226 Difference]: Without dead ends: 747 [2025-03-04 09:25:23,026 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-04 09:25:23,026 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 413 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:23,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 793 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 09:25:23,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2025-03-04 09:25:23,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 700. [2025-03-04 09:25:23,036 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-04 09:25:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 827 transitions. [2025-03-04 09:25:23,038 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 827 transitions. Word has length 5 [2025-03-04 09:25:23,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:23,038 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 827 transitions. [2025-03-04 09:25:23,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:23,038 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 827 transitions. [2025-03-04 09:25:23,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 09:25:23,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:23,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:25:23,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:25:23,038 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-04 09:25:23,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:23,039 INFO L85 PathProgramCache]: Analyzing trace with hash 863731421, now seen corresponding path program 1 times [2025-03-04 09:25:23,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:23,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015465929] [2025-03-04 09:25:23,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:23,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:23,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:25:23,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:25:23,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:23,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:23,064 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-04 09:25:23,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:23,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015465929] [2025-03-04 09:25:23,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015465929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:23,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:23,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:25:23,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948777126] [2025-03-04 09:25:23,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:23,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:25:23,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:23,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:25:23,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:25:23,065 INFO L87 Difference]: Start difference. First operand 700 states and 827 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:23,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:23,130 INFO L93 Difference]: Finished difference Result 1378 states and 1631 transitions. [2025-03-04 09:25:23,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:25:23,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 09:25:23,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:23,134 INFO L225 Difference]: With dead ends: 1378 [2025-03-04 09:25:23,135 INFO L226 Difference]: Without dead ends: 1378 [2025-03-04 09:25:23,135 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-04 09:25:23,135 INFO L435 NwaCegarLoop]: 947 mSDtfsCounter, 718 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 1668 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:23,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 1668 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:25:23,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2025-03-04 09:25:23,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 701. [2025-03-04 09:25:23,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 445 states have (on average 1.847191011235955) internal successors, (822), 696 states have internal predecessors, (822), 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-04 09:25:23,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 828 transitions. [2025-03-04 09:25:23,155 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 828 transitions. Word has length 5 [2025-03-04 09:25:23,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:23,155 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 828 transitions. [2025-03-04 09:25:23,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:23,156 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 828 transitions. [2025-03-04 09:25:23,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 09:25:23,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:23,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:23,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:25:23,156 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-04 09:25:23,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:23,157 INFO L85 PathProgramCache]: Analyzing trace with hash -413060841, now seen corresponding path program 1 times [2025-03-04 09:25:23,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:23,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037478274] [2025-03-04 09:25:23,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:23,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:23,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 09:25:23,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 09:25:23,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:23,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:23,239 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-04 09:25:23,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:23,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037478274] [2025-03-04 09:25:23,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037478274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:23,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:23,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:25:23,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737788562] [2025-03-04 09:25:23,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:23,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:25:23,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:23,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:25:23,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:25:23,241 INFO L87 Difference]: Start difference. First operand 701 states and 828 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) 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-04 09:25:23,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:23,704 INFO L93 Difference]: Finished difference Result 727 states and 881 transitions. [2025-03-04 09:25:23,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:25:23,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) 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-04 09:25:23,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:23,707 INFO L225 Difference]: With dead ends: 727 [2025-03-04 09:25:23,707 INFO L226 Difference]: Without dead ends: 727 [2025-03-04 09:25:23,707 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-04 09:25:23,708 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 938 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:23,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 685 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 09:25:23,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-03-04 09:25:23,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 678. [2025-03-04 09:25:23,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 445 states have (on average 1.7955056179775282) internal successors, (799), 673 states have internal predecessors, (799), 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-04 09:25:23,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 805 transitions. [2025-03-04 09:25:23,722 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 805 transitions. Word has length 14 [2025-03-04 09:25:23,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:23,722 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 805 transitions. [2025-03-04 09:25:23,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) 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-04 09:25:23,722 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 805 transitions. [2025-03-04 09:25:23,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 09:25:23,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:23,723 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:23,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:25:23,723 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-04 09:25:23,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:23,723 INFO L85 PathProgramCache]: Analyzing trace with hash -413060840, now seen corresponding path program 1 times [2025-03-04 09:25:23,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:23,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032192812] [2025-03-04 09:25:23,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:23,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:23,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 09:25:23,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 09:25:23,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:23,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:23,885 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-04 09:25:23,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:23,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032192812] [2025-03-04 09:25:23,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032192812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:23,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:23,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:25:23,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259763819] [2025-03-04 09:25:23,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:23,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:25:23,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:23,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:25:23,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:25:23,887 INFO L87 Difference]: Start difference. First operand 678 states and 805 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) 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-04 09:25:24,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:24,381 INFO L93 Difference]: Finished difference Result 827 states and 1021 transitions. [2025-03-04 09:25:24,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:25:24,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) 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-04 09:25:24,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:24,384 INFO L225 Difference]: With dead ends: 827 [2025-03-04 09:25:24,385 INFO L226 Difference]: Without dead ends: 827 [2025-03-04 09:25:24,385 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-04 09:25:24,386 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 873 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:24,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 1046 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:25:24,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2025-03-04 09:25:24,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 680. [2025-03-04 09:25:24,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 462 states have (on average 1.6753246753246753) internal successors, (774), 675 states have internal predecessors, (774), 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-04 09:25:24,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 780 transitions. [2025-03-04 09:25:24,401 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 780 transitions. Word has length 14 [2025-03-04 09:25:24,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:24,401 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 780 transitions. [2025-03-04 09:25:24,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) 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-04 09:25:24,402 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 780 transitions. [2025-03-04 09:25:24,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 09:25:24,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:24,412 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 09:25:24,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:25:24,413 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-04 09:25:24,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:24,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1496352508, now seen corresponding path program 1 times [2025-03-04 09:25:24,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:24,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613290205] [2025-03-04 09:25:24,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:24,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:24,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 09:25:24,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 09:25:24,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:24,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:24,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 09:25:24,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:24,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613290205] [2025-03-04 09:25:24,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613290205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:24,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:24,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:25:24,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647170341] [2025-03-04 09:25:24,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:24,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:25:24,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:24,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:25:24,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:25:24,592 INFO L87 Difference]: Start difference. First operand 680 states and 780 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-04 09:25:24,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:24,626 INFO L93 Difference]: Finished difference Result 537 states and 597 transitions. [2025-03-04 09:25:24,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:25:24,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 51 [2025-03-04 09:25:24,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:24,628 INFO L225 Difference]: With dead ends: 537 [2025-03-04 09:25:24,628 INFO L226 Difference]: Without dead ends: 537 [2025-03-04 09:25:24,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-04 09:25:24,629 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 50 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1101 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-04 09:25:24,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1101 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:25:24,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-03-04 09:25:24,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2025-03-04 09:25:24,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 342 states have (on average 1.7280701754385965) internal successors, (591), 532 states have internal predecessors, (591), 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-04 09:25:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 597 transitions. [2025-03-04 09:25:24,636 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 597 transitions. Word has length 51 [2025-03-04 09:25:24,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:24,636 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 597 transitions. [2025-03-04 09:25:24,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-04 09:25:24,636 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 597 transitions. [2025-03-04 09:25:24,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 09:25:24,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:24,637 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] [2025-03-04 09:25:24,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:25:24,637 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr260REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-04 09:25:24,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:24,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1163163272, now seen corresponding path program 1 times [2025-03-04 09:25:24,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:24,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479965394] [2025-03-04 09:25:24,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:24,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:24,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 09:25:24,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 09:25:24,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:24,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:24,733 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-04 09:25:24,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:24,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479965394] [2025-03-04 09:25:24,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479965394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:24,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:24,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:25:24,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781344118] [2025-03-04 09:25:24,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:24,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:25:24,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:24,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:25:24,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:25:24,734 INFO L87 Difference]: Start difference. First operand 537 states and 597 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-04 09:25:24,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:24,806 INFO L93 Difference]: Finished difference Result 550 states and 606 transitions. [2025-03-04 09:25:24,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:25:24,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 63 [2025-03-04 09:25:24,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:24,810 INFO L225 Difference]: With dead ends: 550 [2025-03-04 09:25:24,810 INFO L226 Difference]: Without dead ends: 550 [2025-03-04 09:25:24,810 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-04 09:25:24,810 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 56 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:24,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1619 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:25:24,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-04 09:25:24,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 549. [2025-03-04 09:25:24,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 354 states have (on average 1.692090395480226) internal successors, (599), 544 states have internal predecessors, (599), 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-04 09:25:24,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 605 transitions. [2025-03-04 09:25:24,820 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 605 transitions. Word has length 63 [2025-03-04 09:25:24,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:24,820 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 605 transitions. [2025-03-04 09:25:24,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-04 09:25:24,821 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 605 transitions. [2025-03-04 09:25:24,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 09:25:24,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:24,822 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:24,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:25:24,822 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-04 09:25:24,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:24,822 INFO L85 PathProgramCache]: Analyzing trace with hash 451827280, now seen corresponding path program 1 times [2025-03-04 09:25:24,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:24,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67359311] [2025-03-04 09:25:24,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:24,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:24,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 09:25:24,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 09:25:24,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:24,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:24,944 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-04 09:25:24,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:24,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67359311] [2025-03-04 09:25:24,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67359311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:24,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:24,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:25:24,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642772546] [2025-03-04 09:25:24,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:24,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:25:24,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:24,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:25:24,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:25:24,946 INFO L87 Difference]: Start difference. First operand 549 states and 605 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:24,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:24,999 INFO L93 Difference]: Finished difference Result 669 states and 759 transitions. [2025-03-04 09:25:25,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:25:25,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-04 09:25:25,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:25,002 INFO L225 Difference]: With dead ends: 669 [2025-03-04 09:25:25,002 INFO L226 Difference]: Without dead ends: 669 [2025-03-04 09:25:25,002 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-04 09:25:25,003 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 75 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1128 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-04 09:25:25,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1128 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:25:25,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-03-04 09:25:25,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 669. [2025-03-04 09:25:25,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 474 states have (on average 1.5886075949367089) internal successors, (753), 664 states have internal predecessors, (753), 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-04 09:25:25,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 759 transitions. [2025-03-04 09:25:25,011 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 759 transitions. Word has length 71 [2025-03-04 09:25:25,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:25,012 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 759 transitions. [2025-03-04 09:25:25,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:25,012 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 759 transitions. [2025-03-04 09:25:25,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 09:25:25,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:25,013 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:25,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:25:25,013 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr224REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-04 09:25:25,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:25,013 INFO L85 PathProgramCache]: Analyzing trace with hash -879591588, now seen corresponding path program 1 times [2025-03-04 09:25:25,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:25,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323475405] [2025-03-04 09:25:25,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:25,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:25,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 09:25:25,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 09:25:25,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:25,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:25,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:25:25,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:25,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323475405] [2025-03-04 09:25:25,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323475405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:25,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:25,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:25:25,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081277447] [2025-03-04 09:25:25,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:25,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:25:25,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:25,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:25:25,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:25:25,300 INFO L87 Difference]: Start difference. First operand 669 states and 759 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:25,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:25,728 INFO L93 Difference]: Finished difference Result 668 states and 758 transitions. [2025-03-04 09:25:25,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:25:25,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-04 09:25:25,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:25,730 INFO L225 Difference]: With dead ends: 668 [2025-03-04 09:25:25,730 INFO L226 Difference]: Without dead ends: 668 [2025-03-04 09:25:25,730 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-04 09:25:25,731 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 2 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:25,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1566 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 09:25:25,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-03-04 09:25:25,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 668. [2025-03-04 09:25:25,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 474 states have (on average 1.5864978902953586) internal successors, (752), 663 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-04 09:25:25,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 758 transitions. [2025-03-04 09:25:25,742 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 758 transitions. Word has length 79 [2025-03-04 09:25:25,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:25,743 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 758 transitions. [2025-03-04 09:25:25,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:25,743 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 758 transitions. [2025-03-04 09:25:25,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 09:25:25,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:25,744 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:25,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:25:25,744 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr225REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-04 09:25:25,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:25,745 INFO L85 PathProgramCache]: Analyzing trace with hash -879591587, now seen corresponding path program 1 times [2025-03-04 09:25:25,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:25,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729682339] [2025-03-04 09:25:25,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:25,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:25,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 09:25:25,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 09:25:25,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:25,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:26,160 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-04 09:25:26,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:26,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729682339] [2025-03-04 09:25:26,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729682339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:26,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:26,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:25:26,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404976211] [2025-03-04 09:25:26,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:26,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:25:26,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:26,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:25:26,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:25:26,163 INFO L87 Difference]: Start difference. First operand 668 states and 758 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:26,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:26,675 INFO L93 Difference]: Finished difference Result 667 states and 757 transitions. [2025-03-04 09:25:26,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:25:26,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-04 09:25:26,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:26,678 INFO L225 Difference]: With dead ends: 667 [2025-03-04 09:25:26,678 INFO L226 Difference]: Without dead ends: 667 [2025-03-04 09:25:26,678 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-04 09:25:26,679 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 1 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:26,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1529 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:25:26,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-03-04 09:25:26,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2025-03-04 09:25:26,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 473 states have (on average 1.587737843551797) internal successors, (751), 662 states have internal predecessors, (751), 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-04 09:25:26,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 757 transitions. [2025-03-04 09:25:26,687 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 757 transitions. Word has length 79 [2025-03-04 09:25:26,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:26,687 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 757 transitions. [2025-03-04 09:25:26,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:26,687 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 757 transitions. [2025-03-04 09:25:26,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 09:25:26,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:26,687 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-04 09:25:26,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:25:26,688 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr220REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-04 09:25:26,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:26,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1524715047, now seen corresponding path program 1 times [2025-03-04 09:25:26,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:26,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170578558] [2025-03-04 09:25:26,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:26,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:26,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 09:25:26,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 09:25:26,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:26,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:26,867 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-04 09:25:26,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:26,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170578558] [2025-03-04 09:25:26,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170578558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:26,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:26,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:25:26,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397291700] [2025-03-04 09:25:26,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:26,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:25:26,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:26,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:25:26,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:25:26,870 INFO L87 Difference]: Start difference. First operand 667 states and 757 transitions. Second operand has 7 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:25:27,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:27,335 INFO L93 Difference]: Finished difference Result 679 states and 772 transitions. [2025-03-04 09:25:27,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:25:27,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2025-03-04 09:25:27,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:27,338 INFO L225 Difference]: With dead ends: 679 [2025-03-04 09:25:27,338 INFO L226 Difference]: Without dead ends: 679 [2025-03-04 09:25:27,338 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-04 09:25:27,339 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 6 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:27,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2111 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 09:25:27,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-03-04 09:25:27,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 673. [2025-03-04 09:25:27,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 478 states have (on average 1.5857740585774058) internal successors, (758), 667 states have internal predecessors, (758), 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-04 09:25:27,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 767 transitions. [2025-03-04 09:25:27,347 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 767 transitions. Word has length 87 [2025-03-04 09:25:27,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:27,347 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 767 transitions. [2025-03-04 09:25:27,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:25:27,347 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 767 transitions. [2025-03-04 09:25:27,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 09:25:27,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:27,348 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-04 09:25:27,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:25:27,348 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr221REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-04 09:25:27,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:27,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1524715046, now seen corresponding path program 1 times [2025-03-04 09:25:27,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:27,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960928741] [2025-03-04 09:25:27,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:27,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:27,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 09:25:27,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 09:25:27,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:27,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:27,802 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-04 09:25:27,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:27,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960928741] [2025-03-04 09:25:27,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960928741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:27,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:27,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:25:27,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217738188] [2025-03-04 09:25:27,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:27,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:25:27,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:27,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:25:27,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:25:27,804 INFO L87 Difference]: Start difference. First operand 673 states and 767 transitions. Second operand has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:25:28,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:28,430 INFO L93 Difference]: Finished difference Result 673 states and 766 transitions. [2025-03-04 09:25:28,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:25:28,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2025-03-04 09:25:28,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:28,433 INFO L225 Difference]: With dead ends: 673 [2025-03-04 09:25:28,433 INFO L226 Difference]: Without dead ends: 673 [2025-03-04 09:25:28,433 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-04 09:25:28,433 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 1 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:28,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1990 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 09:25:28,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-04 09:25:28,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2025-03-04 09:25:28,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 478 states have (on average 1.5836820083682008) internal successors, (757), 667 states have internal predecessors, (757), 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-04 09:25:28,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 766 transitions. [2025-03-04 09:25:28,442 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 766 transitions. Word has length 87 [2025-03-04 09:25:28,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:28,442 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 766 transitions. [2025-03-04 09:25:28,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:25:28,443 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 766 transitions. [2025-03-04 09:25:28,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 09:25:28,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:28,443 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:28,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 09:25:28,443 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-04 09:25:28,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:28,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1794683101, now seen corresponding path program 1 times [2025-03-04 09:25:28,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:28,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373102732] [2025-03-04 09:25:28,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:28,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:28,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 09:25:28,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 09:25:28,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:28,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:28,790 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-04 09:25:28,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:28,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373102732] [2025-03-04 09:25:28,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373102732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:28,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396564054] [2025-03-04 09:25:28,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:28,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:25:28,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:25:28,793 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-04 09:25:28,795 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-04 09:25:28,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 09:25:28,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 09:25:28,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:28,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:28,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 09:25:28,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:25:28,956 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-04 09:25:29,054 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:25:29,054 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-04 09:25:29,062 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-04 09:25:29,110 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:29,110 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-04 09:25:29,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-04 09:25:29,134 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-04 09:25:29,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:25:29,176 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-03-04 09:25:29,176 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-04 09:25:29,185 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_443 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_443) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2025-03-04 09:25:29,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396564054] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:29,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:25:29,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2025-03-04 09:25:29,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336530234] [2025-03-04 09:25:29,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:25:29,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 09:25:29,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:29,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 09:25:29,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2025-03-04 09:25:29,192 INFO L87 Difference]: Start difference. First operand 673 states and 766 transitions. Second operand has 14 states, 12 states have (on average 10.583333333333334) internal successors, (127), 13 states have internal predecessors, (127), 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-04 09:25:30,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:30,537 INFO L93 Difference]: Finished difference Result 672 states and 765 transitions. [2025-03-04 09:25:30,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:25:30,538 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.583333333333334) internal successors, (127), 13 states have internal predecessors, (127), 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 88 [2025-03-04 09:25:30,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:30,540 INFO L225 Difference]: With dead ends: 672 [2025-03-04 09:25:30,540 INFO L226 Difference]: Without dead ends: 672 [2025-03-04 09:25:30,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=342, Unknown=1, NotChecked=38, Total=462 [2025-03-04 09:25:30,540 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 486 mSDsluCounter, 3004 mSDsCounter, 0 mSdLazyCounter, 3084 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 3326 SdHoareTripleChecker+Invalid, 3098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:30,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 3326 Invalid, 3098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3084 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 09:25:30,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-04 09:25:30,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2025-03-04 09:25:30,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 478 states have (on average 1.5815899581589958) internal successors, (756), 666 states have internal predecessors, (756), 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-04 09:25:30,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 765 transitions. [2025-03-04 09:25:30,548 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 765 transitions. Word has length 88 [2025-03-04 09:25:30,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:30,548 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 765 transitions. [2025-03-04 09:25:30,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.583333333333334) internal successors, (127), 13 states have internal predecessors, (127), 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-04 09:25:30,549 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 765 transitions. [2025-03-04 09:25:30,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 09:25:30,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:30,549 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:30,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 09:25:30,753 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,SelfDestructingSolverStorable13 [2025-03-04 09:25:30,753 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-04 09:25:30,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:30,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1794683100, now seen corresponding path program 1 times [2025-03-04 09:25:30,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:30,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059268287] [2025-03-04 09:25:30,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:30,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:30,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 09:25:30,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 09:25:30,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:30,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:31,250 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-04 09:25:31,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:31,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059268287] [2025-03-04 09:25:31,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059268287] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:31,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201687133] [2025-03-04 09:25:31,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:31,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:25:31,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:25:31,252 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-04 09:25:31,254 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-04 09:25:31,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 09:25:31,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 09:25:31,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:31,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:31,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 09:25:31,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:25:31,409 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-04 09:25:31,502 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:25:31,502 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-04 09:25:31,523 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-04 09:25:31,528 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-04 09:25:31,670 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:31,670 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-04 09:25:31,675 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-04 09:25:31,709 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-04 09:25:31,717 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-04 09:25:31,735 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-04 09:25:31,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:25:31,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:25:31,833 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-04 09:25:31,871 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_1 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_1) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))) (forall ((v_ArrVal_571 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_571) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_#t~mem51#1.offset| 25))) (forall ((v_ArrVal_572 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_572) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem51#1.base|)))) is different from false [2025-03-04 09:25:31,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201687133] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:31,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:25:31,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2025-03-04 09:25:31,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926588711] [2025-03-04 09:25:31,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:25:31,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 09:25:31,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:31,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 09:25:31,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=361, Unknown=1, NotChecked=38, Total=462 [2025-03-04 09:25:31,874 INFO L87 Difference]: Start difference. First operand 672 states and 765 transitions. Second operand has 19 states, 16 states have (on average 8.6875) internal successors, (139), 19 states have internal predecessors, (139), 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-04 09:25:33,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:33,343 INFO L93 Difference]: Finished difference Result 671 states and 764 transitions. [2025-03-04 09:25:33,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 09:25:33,344 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.6875) internal successors, (139), 19 states have internal predecessors, (139), 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 88 [2025-03-04 09:25:33,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:33,350 INFO L225 Difference]: With dead ends: 671 [2025-03-04 09:25:33,350 INFO L226 Difference]: Without dead ends: 671 [2025-03-04 09:25:33,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=505, Unknown=1, NotChecked=46, Total=650 [2025-03-04 09:25:33,350 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 528 mSDsluCounter, 2957 mSDsCounter, 0 mSdLazyCounter, 3751 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 3278 SdHoareTripleChecker+Invalid, 3769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:33,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 3278 Invalid, 3769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3751 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 09:25:33,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-03-04 09:25:33,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 665. [2025-03-04 09:25:33,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 473 states have (on average 1.5835095137420718) internal successors, (749), 660 states have internal predecessors, (749), 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-04 09:25:33,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 755 transitions. [2025-03-04 09:25:33,360 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 755 transitions. Word has length 88 [2025-03-04 09:25:33,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:33,360 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 755 transitions. [2025-03-04 09:25:33,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.6875) internal successors, (139), 19 states have internal predecessors, (139), 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-04 09:25:33,360 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 755 transitions. [2025-03-04 09:25:33,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 09:25:33,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:33,361 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-04 09:25:33,368 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-04 09:25:33,565 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,SelfDestructingSolverStorable14 [2025-03-04 09:25:33,565 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr216REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-04 09:25:33,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:33,565 INFO L85 PathProgramCache]: Analyzing trace with hash 788597119, now seen corresponding path program 1 times [2025-03-04 09:25:33,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:33,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104587127] [2025-03-04 09:25:33,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:33,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:33,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 09:25:33,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 09:25:33,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:33,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:33,894 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-04 09:25:33,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:33,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104587127] [2025-03-04 09:25:33,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104587127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:33,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:33,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 09:25:33,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98414614] [2025-03-04 09:25:33,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:33,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 09:25:33,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:33,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 09:25:33,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:25:33,896 INFO L87 Difference]: Start difference. First operand 665 states and 755 transitions. Second operand has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:25:34,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:34,858 INFO L93 Difference]: Finished difference Result 675 states and 768 transitions. [2025-03-04 09:25:34,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 09:25:34,858 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2025-03-04 09:25:34,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:34,860 INFO L225 Difference]: With dead ends: 675 [2025-03-04 09:25:34,860 INFO L226 Difference]: Without dead ends: 675 [2025-03-04 09:25:34,860 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-04 09:25:34,861 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 534 mSDsluCounter, 2684 mSDsCounter, 0 mSdLazyCounter, 2787 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 3005 SdHoareTripleChecker+Invalid, 2800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:34,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 3005 Invalid, 2800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2787 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 09:25:34,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2025-03-04 09:25:34,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 674. [2025-03-04 09:25:34,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 481 states have (on average 1.5779625779625779) internal successors, (759), 668 states have internal predecessors, (759), 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-04 09:25:34,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 768 transitions. [2025-03-04 09:25:34,868 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 768 transitions. Word has length 90 [2025-03-04 09:25:34,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:34,868 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 768 transitions. [2025-03-04 09:25:34,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 13 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:25:34,868 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 768 transitions. [2025-03-04 09:25:34,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 09:25:34,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:34,869 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-04 09:25:34,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 09:25:34,869 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr217REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-04 09:25:34,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:34,870 INFO L85 PathProgramCache]: Analyzing trace with hash 788597120, now seen corresponding path program 1 times [2025-03-04 09:25:34,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:34,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63719748] [2025-03-04 09:25:34,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:34,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:34,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 09:25:34,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 09:25:34,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:34,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:35,301 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-04 09:25:35,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:35,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63719748] [2025-03-04 09:25:35,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63719748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:35,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:35,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 09:25:35,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207831568] [2025-03-04 09:25:35,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:35,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 09:25:35,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:35,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 09:25:35,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 09:25:35,304 INFO L87 Difference]: Start difference. First operand 674 states and 768 transitions. Second operand has 11 states, 10 states have (on average 8.8) internal successors, (88), 11 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:25:36,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:36,084 INFO L93 Difference]: Finished difference Result 674 states and 767 transitions. [2025-03-04 09:25:36,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:25:36,085 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.8) internal successors, (88), 11 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2025-03-04 09:25:36,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:36,087 INFO L225 Difference]: With dead ends: 674 [2025-03-04 09:25:36,087 INFO L226 Difference]: Without dead ends: 674 [2025-03-04 09:25:36,087 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-04 09:25:36,087 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 554 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:36,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1615 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1917 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 09:25:36,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-03-04 09:25:36,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2025-03-04 09:25:36,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 481 states have (on average 1.5758835758835759) internal successors, (758), 668 states have internal predecessors, (758), 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-04 09:25:36,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 767 transitions. [2025-03-04 09:25:36,094 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 767 transitions. Word has length 90 [2025-03-04 09:25:36,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:36,095 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 767 transitions. [2025-03-04 09:25:36,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.8) internal successors, (88), 11 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:25:36,095 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 767 transitions. [2025-03-04 09:25:36,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 09:25:36,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:36,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:36,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 09:25:36,096 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-04 09:25:36,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:36,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1650921483, now seen corresponding path program 1 times [2025-03-04 09:25:36,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:36,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466901754] [2025-03-04 09:25:36,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:36,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:36,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 09:25:36,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 09:25:36,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:36,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:36,437 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-04 09:25:36,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:36,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466901754] [2025-03-04 09:25:36,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466901754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:36,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880670404] [2025-03-04 09:25:36,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:36,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:25:36,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:25:36,440 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-04 09:25:36,442 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-04 09:25:36,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 09:25:36,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 09:25:36,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:36,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:36,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 09:25:36,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:25:36,592 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-04 09:25:36,667 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:25:36,668 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-04 09:25:36,674 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-04 09:25:36,737 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:36,738 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-04 09:25:36,784 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:36,785 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-04 09:25:36,795 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-04 09:25:36,797 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-04 09:25:36,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:25:36,875 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-03-04 09:25:36,875 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-04 09:25:36,881 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_824 (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 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_824))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_821)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2025-03-04 09:25:36,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880670404] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:36,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:25:36,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 16 [2025-03-04 09:25:36,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277894506] [2025-03-04 09:25:36,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:25:36,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 09:25:36,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:36,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 09:25:36,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=280, Unknown=11, NotChecked=34, Total=380 [2025-03-04 09:25:36,883 INFO L87 Difference]: Start difference. First operand 674 states and 767 transitions. Second operand has 17 states, 15 states have (on average 9.2) internal successors, (138), 17 states have internal predecessors, (138), 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-04 09:25:37,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:37,904 INFO L93 Difference]: Finished difference Result 673 states and 766 transitions. [2025-03-04 09:25:37,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:25:37,904 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 9.2) internal successors, (138), 17 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 91 [2025-03-04 09:25:37,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:37,906 INFO L225 Difference]: With dead ends: 673 [2025-03-04 09:25:37,906 INFO L226 Difference]: Without dead ends: 673 [2025-03-04 09:25:37,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=533, Unknown=11, NotChecked=48, Total=702 [2025-03-04 09:25:37,907 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 526 mSDsluCounter, 2734 mSDsCounter, 0 mSdLazyCounter, 2796 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 3055 SdHoareTripleChecker+Invalid, 2812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:37,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 3055 Invalid, 2812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2796 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 09:25:37,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-04 09:25:37,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2025-03-04 09:25:37,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 481 states have (on average 1.5738045738045738) internal successors, (757), 667 states have internal predecessors, (757), 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-04 09:25:37,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 766 transitions. [2025-03-04 09:25:37,913 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 766 transitions. Word has length 91 [2025-03-04 09:25:37,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:37,914 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 766 transitions. [2025-03-04 09:25:37,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 9.2) internal successors, (138), 17 states have internal predecessors, (138), 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-04 09:25:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 766 transitions. [2025-03-04 09:25:37,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 09:25:37,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:37,914 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:37,922 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-04 09:25:38,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 09:25:38,119 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-04 09:25:38,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:38,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1650921482, now seen corresponding path program 1 times [2025-03-04 09:25:38,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:38,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089138269] [2025-03-04 09:25:38,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:38,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:38,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 09:25:38,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 09:25:38,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:38,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:38,613 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-04 09:25:38,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:38,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089138269] [2025-03-04 09:25:38,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089138269] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:38,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313602374] [2025-03-04 09:25:38,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:38,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:25:38,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:25:38,616 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-04 09:25:38,618 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-04 09:25:38,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 09:25:38,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 09:25:38,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:38,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:38,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 09:25:38,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:25:38,777 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-04 09:25:38,851 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:25:38,851 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-04 09:25:38,872 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-04 09:25:38,874 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-04 09:25:38,997 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:38,997 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-04 09:25:39,003 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-04 09:25:39,064 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:39,065 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-04 09:25:39,073 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-04 09:25:39,085 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-04 09:25:39,087 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-04 09:25:39,101 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-04 09:25:39,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:25:39,149 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_960 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_961 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))))) is different from false [2025-03-04 09:25:39,159 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_960 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_961 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-03-04 09:25:39,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:25:39,218 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-04 09:25:39,260 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_966 (Array Int Int)) (v_ArrVal_967 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_967) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_966) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_prenex_2 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_2))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_960)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem51#1.base|)) (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_3) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_2) |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))))) is different from false [2025-03-04 09:25:39,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313602374] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:39,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:25:39,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2025-03-04 09:25:39,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616845404] [2025-03-04 09:25:39,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:25:39,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 09:25:39,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:39,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 09:25:39,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=437, Unknown=3, NotChecked=132, Total=650 [2025-03-04 09:25:39,264 INFO L87 Difference]: Start difference. First operand 673 states and 766 transitions. Second operand has 21 states, 18 states have (on average 8.055555555555555) internal successors, (145), 21 states have internal predecessors, (145), 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-04 09:25:40,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:40,768 INFO L93 Difference]: Finished difference Result 672 states and 765 transitions. [2025-03-04 09:25:40,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:25:40,769 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.055555555555555) internal successors, (145), 21 states have internal predecessors, (145), 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 91 [2025-03-04 09:25:40,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:40,770 INFO L225 Difference]: With dead ends: 672 [2025-03-04 09:25:40,770 INFO L226 Difference]: Without dead ends: 672 [2025-03-04 09:25:40,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=640, Unknown=3, NotChecked=162, Total=930 [2025-03-04 09:25:40,771 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 503 mSDsluCounter, 3133 mSDsCounter, 0 mSdLazyCounter, 4051 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 3453 SdHoareTripleChecker+Invalid, 4069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:40,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 3453 Invalid, 4069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4051 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 09:25:40,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-04 09:25:40,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 663. [2025-03-04 09:25:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 473 states have (on average 1.5792811839323466) internal successors, (747), 658 states have internal predecessors, (747), 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-04 09:25:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 753 transitions. [2025-03-04 09:25:40,777 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 753 transitions. Word has length 91 [2025-03-04 09:25:40,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:40,777 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 753 transitions. [2025-03-04 09:25:40,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.055555555555555) internal successors, (145), 21 states have internal predecessors, (145), 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-04 09:25:40,778 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 753 transitions. [2025-03-04 09:25:40,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 09:25:40,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:40,778 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-04 09:25:40,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 09:25:40,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:25:40,979 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr212REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-04 09:25:40,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:40,979 INFO L85 PathProgramCache]: Analyzing trace with hash -373904142, now seen corresponding path program 1 times [2025-03-04 09:25:40,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:40,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931958827] [2025-03-04 09:25:40,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:40,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:40,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 09:25:41,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 09:25:41,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:41,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:41,304 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-04 09:25:41,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:41,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931958827] [2025-03-04 09:25:41,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931958827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:41,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:41,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 09:25:41,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821931773] [2025-03-04 09:25:41,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:41,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 09:25:41,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:41,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 09:25:41,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-04 09:25:41,306 INFO L87 Difference]: Start difference. First operand 663 states and 753 transitions. Second operand has 15 states, 13 states have (on average 7.0) internal successors, (91), 14 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:25:42,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:42,337 INFO L93 Difference]: Finished difference Result 676 states and 769 transitions. [2025-03-04 09:25:42,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:25:42,338 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.0) internal successors, (91), 14 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2025-03-04 09:25:42,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:42,340 INFO L225 Difference]: With dead ends: 676 [2025-03-04 09:25:42,340 INFO L226 Difference]: Without dead ends: 676 [2025-03-04 09:25:42,340 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-04 09:25:42,340 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 537 mSDsluCounter, 2984 mSDsCounter, 0 mSdLazyCounter, 3048 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 3304 SdHoareTripleChecker+Invalid, 3061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:42,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 3304 Invalid, 3061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3048 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 09:25:42,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-03-04 09:25:42,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 675. [2025-03-04 09:25:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 484 states have (on average 1.5702479338842976) internal successors, (760), 669 states have internal predecessors, (760), 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-04 09:25:42,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 769 transitions. [2025-03-04 09:25:42,347 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 769 transitions. Word has length 93 [2025-03-04 09:25:42,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:42,348 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 769 transitions. [2025-03-04 09:25:42,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.0) internal successors, (91), 14 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:25:42,348 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 769 transitions. [2025-03-04 09:25:42,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 09:25:42,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:42,348 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-04 09:25:42,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 09:25:42,349 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr213REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-04 09:25:42,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:42,349 INFO L85 PathProgramCache]: Analyzing trace with hash -373904141, now seen corresponding path program 1 times [2025-03-04 09:25:42,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:42,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996152013] [2025-03-04 09:25:42,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:42,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:42,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 09:25:42,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 09:25:42,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:42,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:42,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:25:42,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:42,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996152013] [2025-03-04 09:25:42,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996152013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:42,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:42,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 09:25:42,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122907473] [2025-03-04 09:25:42,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:42,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 09:25:42,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:42,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 09:25:42,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 09:25:42,836 INFO L87 Difference]: Start difference. First operand 675 states and 769 transitions. Second operand has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:25:43,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:43,698 INFO L93 Difference]: Finished difference Result 675 states and 768 transitions. [2025-03-04 09:25:43,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:25:43,698 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2025-03-04 09:25:43,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:43,700 INFO L225 Difference]: With dead ends: 675 [2025-03-04 09:25:43,700 INFO L226 Difference]: Without dead ends: 675 [2025-03-04 09:25:43,700 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-04 09:25:43,701 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 517 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 1919 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:43,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1617 Invalid, 1931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1919 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 09:25:43,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2025-03-04 09:25:43,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 675. [2025-03-04 09:25:43,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 484 states have (on average 1.5681818181818181) internal successors, (759), 669 states have internal predecessors, (759), 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-04 09:25:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 768 transitions. [2025-03-04 09:25:43,707 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 768 transitions. Word has length 93 [2025-03-04 09:25:43,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:43,707 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 768 transitions. [2025-03-04 09:25:43,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 12 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:25:43,708 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 768 transitions. [2025-03-04 09:25:43,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 09:25:43,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:43,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:43,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 09:25:43,708 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-04 09:25:43,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:43,709 INFO L85 PathProgramCache]: Analyzing trace with hash -930960708, now seen corresponding path program 1 times [2025-03-04 09:25:43,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:43,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771356876] [2025-03-04 09:25:43,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:43,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:43,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 09:25:43,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 09:25:43,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:43,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:44,047 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-04 09:25:44,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:44,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771356876] [2025-03-04 09:25:44,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771356876] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:44,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925708117] [2025-03-04 09:25:44,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:44,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:25:44,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:25:44,050 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-04 09:25:44,052 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-04 09:25:44,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 09:25:44,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 09:25:44,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:44,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:44,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 09:25:44,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:25:44,209 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-04 09:25:44,279 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:25:44,279 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-04 09:25:44,283 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-04 09:25:44,342 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:44,343 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-04 09:25:44,380 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:44,380 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-04 09:25:44,413 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:44,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:25:44,424 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-04 09:25:44,426 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-04 09:25:44,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:25:44,434 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1241 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1241) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-03-04 09:25:44,470 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1241 (Array Int Int)) (v_ArrVal_1240 (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_1240))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1241)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:25:44,525 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2025-03-04 09:25:44,525 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-04 09:25:44,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925708117] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:44,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:25:44,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 18 [2025-03-04 09:25:44,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054115608] [2025-03-04 09:25:44,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:25:44,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 09:25:44,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:44,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 09:25:44,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=380, Unknown=18, NotChecked=82, Total=552 [2025-03-04 09:25:44,562 INFO L87 Difference]: Start difference. First operand 675 states and 768 transitions. Second operand has 19 states, 17 states have (on average 8.411764705882353) internal successors, (143), 19 states have internal predecessors, (143), 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-04 09:25:45,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:45,623 INFO L93 Difference]: Finished difference Result 674 states and 767 transitions. [2025-03-04 09:25:45,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 09:25:45,626 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.411764705882353) internal successors, (143), 19 states have internal predecessors, (143), 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 94 [2025-03-04 09:25:45,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:45,628 INFO L225 Difference]: With dead ends: 674 [2025-03-04 09:25:45,628 INFO L226 Difference]: Without dead ends: 674 [2025-03-04 09:25:45,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=715, Unknown=19, NotChecked=114, Total=992 [2025-03-04 09:25:45,630 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 501 mSDsluCounter, 3035 mSDsCounter, 0 mSdLazyCounter, 3079 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 3355 SdHoareTripleChecker+Invalid, 3092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:45,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 3355 Invalid, 3092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3079 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 09:25:45,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-03-04 09:25:45,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2025-03-04 09:25:45,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 484 states have (on average 1.5661157024793388) internal successors, (758), 668 states have internal predecessors, (758), 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-04 09:25:45,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 767 transitions. [2025-03-04 09:25:45,637 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 767 transitions. Word has length 94 [2025-03-04 09:25:45,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:45,637 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 767 transitions. [2025-03-04 09:25:45,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.411764705882353) internal successors, (143), 19 states have internal predecessors, (143), 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-04 09:25:45,638 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 767 transitions. [2025-03-04 09:25:45,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 09:25:45,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:45,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:45,645 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-04 09:25:45,838 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,SelfDestructingSolverStorable21 [2025-03-04 09:25:45,839 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-04 09:25:45,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:45,839 INFO L85 PathProgramCache]: Analyzing trace with hash -930960707, now seen corresponding path program 1 times [2025-03-04 09:25:45,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:45,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319299980] [2025-03-04 09:25:45,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:45,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:45,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 09:25:45,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 09:25:45,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:45,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:46,395 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-04 09:25:46,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:46,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319299980] [2025-03-04 09:25:46,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319299980] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:46,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710947442] [2025-03-04 09:25:46,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:46,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:25:46,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:25:46,398 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-04 09:25:46,399 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-04 09:25:46,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 09:25:46,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 09:25:46,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:46,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:46,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 09:25:46,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:25:46,555 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-04 09:25:46,627 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-04 09:25:46,636 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:25:46,636 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-04 09:25:46,641 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-04 09:25:46,644 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-04 09:25:46,681 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-04 09:25:46,684 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-04 09:25:46,749 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:46,750 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-04 09:25:46,754 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-04 09:25:46,791 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:46,791 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-04 09:25:46,799 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-04 09:25:46,839 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:46,839 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-04 09:25:46,852 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-04 09:25:46,861 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-04 09:25:46,865 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-04 09:25:46,867 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-04 09:25:46,867 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:25:46,915 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1396 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1396) |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_1395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-04 09:25:46,927 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_1396 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-03-04 09:25:46,942 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int)) (v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1393))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1394) .cse0 v_ArrVal_1396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1394) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2025-03-04 09:25:46,950 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_1396 (Array Int Int)) (v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1394) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int)) (v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1393))) (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_1394) .cse2 v_ArrVal_1396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2025-03-04 09:25:46,994 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1402 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1402))) (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_1401) .cse0 v_ArrVal_1394) (select (select (store .cse1 .cse0 v_ArrVal_1393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1396))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1402 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int)) (v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1402))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1393))) (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_1401) .cse3 v_ArrVal_1394) .cse4 v_ArrVal_1396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2025-03-04 09:25:46,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710947442] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:46,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:25:46,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 17 [2025-03-04 09:25:46,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120796154] [2025-03-04 09:25:46,996 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:25:46,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 09:25:46,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:46,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 09:25:46,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=321, Unknown=5, NotChecked=200, Total=600 [2025-03-04 09:25:46,997 INFO L87 Difference]: Start difference. First operand 674 states and 767 transitions. Second operand has 18 states, 16 states have (on average 8.875) internal successors, (142), 18 states have internal predecessors, (142), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 09:25:48,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:48,177 INFO L93 Difference]: Finished difference Result 681 states and 774 transitions. [2025-03-04 09:25:48,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:25:48,177 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.875) internal successors, (142), 18 states have internal predecessors, (142), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 94 [2025-03-04 09:25:48,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:48,179 INFO L225 Difference]: With dead ends: 681 [2025-03-04 09:25:48,179 INFO L226 Difference]: Without dead ends: 681 [2025-03-04 09:25:48,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=546, Unknown=5, NotChecked=260, Total=930 [2025-03-04 09:25:48,180 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 500 mSDsluCounter, 2003 mSDsCounter, 0 mSdLazyCounter, 2845 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 2325 SdHoareTripleChecker+Invalid, 2861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:48,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 2325 Invalid, 2861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2845 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 09:25:48,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-03-04 09:25:48,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 666. [2025-03-04 09:25:48,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 477 states have (on average 1.5723270440251573) internal successors, (750), 660 states have internal predecessors, (750), 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-04 09:25:48,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 756 transitions. [2025-03-04 09:25:48,185 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 756 transitions. Word has length 94 [2025-03-04 09:25:48,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:48,186 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 756 transitions. [2025-03-04 09:25:48,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.875) internal successors, (142), 18 states have internal predecessors, (142), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 09:25:48,186 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 756 transitions. [2025-03-04 09:25:48,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 09:25:48,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:48,186 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-04 09:25:48,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 09:25:48,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:25:48,387 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr208REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-04 09:25:48,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:48,387 INFO L85 PathProgramCache]: Analyzing trace with hash -2127669896, now seen corresponding path program 1 times [2025-03-04 09:25:48,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:48,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145582121] [2025-03-04 09:25:48,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:48,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:48,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 09:25:48,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 09:25:48,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:48,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:48,732 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-04 09:25:48,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:48,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145582121] [2025-03-04 09:25:48,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145582121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:48,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:48,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 09:25:48,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225736837] [2025-03-04 09:25:48,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:48,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 09:25:48,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:48,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 09:25:48,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-04 09:25:48,733 INFO L87 Difference]: Start difference. First operand 666 states and 756 transitions. Second operand has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 15 states have internal predecessors, (94), 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-04 09:25:49,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:49,852 INFO L93 Difference]: Finished difference Result 685 states and 778 transitions. [2025-03-04 09:25:49,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 09:25:49,852 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 15 states have internal predecessors, (94), 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 96 [2025-03-04 09:25:49,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:49,854 INFO L225 Difference]: With dead ends: 685 [2025-03-04 09:25:49,854 INFO L226 Difference]: Without dead ends: 685 [2025-03-04 09:25:49,854 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-04 09:25:49,854 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 536 mSDsluCounter, 3280 mSDsCounter, 0 mSdLazyCounter, 3331 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 3599 SdHoareTripleChecker+Invalid, 3344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:49,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 3599 Invalid, 3344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3331 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 09:25:49,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-03-04 09:25:49,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 681. [2025-03-04 09:25:49,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 491 states have (on average 1.560081466395112) internal successors, (766), 674 states have internal predecessors, (766), 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-04 09:25:49,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 773 transitions. [2025-03-04 09:25:49,860 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 773 transitions. Word has length 96 [2025-03-04 09:25:49,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:49,860 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 773 transitions. [2025-03-04 09:25:49,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 15 states have internal predecessors, (94), 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-04 09:25:49,861 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 773 transitions. [2025-03-04 09:25:49,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 09:25:49,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:49,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:49,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 09:25:49,861 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr209REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-04 09:25:49,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:49,862 INFO L85 PathProgramCache]: Analyzing trace with hash -2127669895, now seen corresponding path program 1 times [2025-03-04 09:25:49,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:49,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511797720] [2025-03-04 09:25:49,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:49,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:49,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 09:25:49,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 09:25:49,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:49,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:50,309 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-04 09:25:50,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:50,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511797720] [2025-03-04 09:25:50,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511797720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:50,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:50,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 09:25:50,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75493850] [2025-03-04 09:25:50,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:50,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:25:50,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:50,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:25:50,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:25:50,310 INFO L87 Difference]: Start difference. First operand 681 states and 773 transitions. Second operand has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 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-04 09:25:51,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:51,306 INFO L93 Difference]: Finished difference Result 684 states and 777 transitions. [2025-03-04 09:25:51,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 09:25:51,306 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 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 96 [2025-03-04 09:25:51,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:51,308 INFO L225 Difference]: With dead ends: 684 [2025-03-04 09:25:51,308 INFO L226 Difference]: Without dead ends: 684 [2025-03-04 09:25:51,308 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-04 09:25:51,308 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 556 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 2617 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 2067 SdHoareTripleChecker+Invalid, 2629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:51,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 2067 Invalid, 2629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2617 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 09:25:51,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-03-04 09:25:51,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 681. [2025-03-04 09:25:51,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 491 states have (on average 1.5580448065173116) internal successors, (765), 674 states have internal predecessors, (765), 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-04 09:25:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 772 transitions. [2025-03-04 09:25:51,314 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 772 transitions. Word has length 96 [2025-03-04 09:25:51,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:51,315 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 772 transitions. [2025-03-04 09:25:51,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 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-04 09:25:51,315 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 772 transitions. [2025-03-04 09:25:51,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 09:25:51,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:51,316 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] [2025-03-04 09:25:51,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 09:25:51,316 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-04 09:25:51,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:51,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1646195858, now seen corresponding path program 1 times [2025-03-04 09:25:51,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:51,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317309411] [2025-03-04 09:25:51,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:51,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:51,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 09:25:51,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 09:25:51,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:51,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:51,653 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-04 09:25:51,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:51,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317309411] [2025-03-04 09:25:51,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317309411] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:51,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947908829] [2025-03-04 09:25:51,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:51,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:25:51,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:25:51,655 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-04 09:25:51,655 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-04 09:25:51,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 09:25:51,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 09:25:51,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:51,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:51,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 09:25:51,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:25:51,812 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-04 09:25:51,879 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:25:51,879 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-04 09:25:51,883 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-04 09:25:51,933 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:51,933 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-04 09:25:51,961 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:51,961 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-04 09:25:51,987 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:51,987 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-04 09:25:52,013 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:52,014 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-04 09:25:52,021 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-04 09:25:52,022 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-04 09:25:52,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:25:52,072 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1700 (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_1700))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1701)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:25:52,103 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1699 (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_1699))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1700)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1701)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:25:56,239 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2025-03-04 09:25:56,240 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-04 09:25:56,251 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1699 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= (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_1704))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1699)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1700)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1701)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem51#1.base|)) is different from false [2025-03-04 09:25:56,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947908829] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:56,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:25:56,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 20 [2025-03-04 09:25:56,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563212288] [2025-03-04 09:25:56,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:25:56,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 09:25:56,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:56,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 09:25:56,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=475, Unknown=40, NotChecked=144, Total=756 [2025-03-04 09:25:56,253 INFO L87 Difference]: Start difference. First operand 681 states and 772 transitions. Second operand has 21 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 21 states have internal predecessors, (148), 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-04 09:25:57,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:57,712 INFO L93 Difference]: Finished difference Result 683 states and 776 transitions. [2025-03-04 09:25:57,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 09:25:57,713 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 21 states have internal predecessors, (148), 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 97 [2025-03-04 09:25:57,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:57,714 INFO L225 Difference]: With dead ends: 683 [2025-03-04 09:25:57,714 INFO L226 Difference]: Without dead ends: 683 [2025-03-04 09:25:57,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=186, Invalid=903, Unknown=45, NotChecked=198, Total=1332 [2025-03-04 09:25:57,715 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 518 mSDsluCounter, 3010 mSDsCounter, 0 mSdLazyCounter, 3072 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 3329 SdHoareTripleChecker+Invalid, 3088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:57,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 3329 Invalid, 3088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3072 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 09:25:57,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-03-04 09:25:57,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 680. [2025-03-04 09:25:57,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 491 states have (on average 1.5560081466395113) internal successors, (764), 673 states have internal predecessors, (764), 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-04 09:25:57,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 771 transitions. [2025-03-04 09:25:57,721 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 771 transitions. Word has length 97 [2025-03-04 09:25:57,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:57,721 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 771 transitions. [2025-03-04 09:25:57,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.7894736842105265) internal successors, (148), 21 states have internal predecessors, (148), 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-04 09:25:57,721 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 771 transitions. [2025-03-04 09:25:57,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 09:25:57,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:57,722 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] [2025-03-04 09:25:57,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 09:25:57,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:25:57,923 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-04 09:25:57,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:57,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1646195857, now seen corresponding path program 1 times [2025-03-04 09:25:57,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:57,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813923611] [2025-03-04 09:25:57,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:57,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:57,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 09:25:57,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 09:25:57,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:57,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:58,527 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-04 09:25:58,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:58,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813923611] [2025-03-04 09:25:58,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813923611] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:58,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126103682] [2025-03-04 09:25:58,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:58,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:25:58,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:25:58,529 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-04 09:25:58,530 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-04 09:25:58,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 09:25:58,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 09:25:58,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:58,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:58,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 09:25:58,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:25:58,692 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-04 09:25:58,779 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-04 09:25:58,786 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:25:58,786 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-04 09:25:58,808 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-04 09:25:58,811 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-04 09:25:58,863 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-04 09:25:58,866 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-04 09:25:58,929 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:58,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:25:58,935 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-04 09:25:58,992 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:58,993 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-04 09:25:58,998 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-04 09:25:59,037 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:59,038 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-04 09:25:59,040 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-04 09:25:59,087 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:59,087 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-04 09:25:59,092 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 41 treesize of output 22 [2025-03-04 09:25:59,124 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-04 09:25:59,129 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 30 treesize of output 12 [2025-03-04 09:25:59,147 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-04 09:25:59,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:25:59,284 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1868 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1868))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) 0) (forall ((v_ArrVal_1867 (Array Int Int)) (v_ArrVal_1870 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) (forall ((v_ArrVal_1868 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1868))) (or (< (+ (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) 0) (forall ((v_ArrVal_1867 (Array Int Int)) (v_ArrVal_1870 (Array Int Int)) (v_ArrVal_1869 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1867))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse2 .cse3 v_ArrVal_1870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) is different from false [2025-03-04 09:25:59,397 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1866 (Array Int Int)) (v_ArrVal_1865 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1865))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1866) .cse5 v_ArrVal_1868))) (or (< (+ 8 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_1867 (Array Int Int)) (v_ArrVal_1870 (Array Int Int)) (v_ArrVal_1869 (Array Int Int))) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_1867))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse0 .cse2 v_ArrVal_1870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1866 (Array Int Int)) (v_ArrVal_1865 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1865))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1866) .cse8 v_ArrVal_1868))) (or (forall ((v_ArrVal_1867 (Array Int Int)) (v_ArrVal_1870 (Array Int Int))) (<= 0 (+ (select (select (store .cse6 (select (select (store .cse7 .cse8 v_ArrVal_1867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (< (+ 8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0)))))))) is different from false [2025-03-04 09:25:59,416 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1866 (Array Int Int)) (v_ArrVal_1865 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_1865))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1866) .cse2 v_ArrVal_1868))) (or (forall ((v_ArrVal_1867 (Array Int Int)) (v_ArrVal_1870 (Array Int Int))) (<= 0 (+ 20 (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_1867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 8) 0)))))) (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1866 (Array Int Int)) (v_ArrVal_1865 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_1865))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1866) .cse9 v_ArrVal_1868))) (or (forall ((v_ArrVal_1867 (Array Int Int)) (v_ArrVal_1870 (Array Int Int)) (v_ArrVal_1869 (Array Int Int))) (let ((.cse7 (store .cse8 .cse9 v_ArrVal_1867))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 24 (select (select (store .cse5 .cse6 v_ArrVal_1870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_1869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))) (< (+ (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 8) 0))))))))) is different from false [2025-03-04 09:25:59,475 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1866 (Array Int Int)) (v_ArrVal_1876 (Array Int Int)) (v_ArrVal_1865 (Array Int Int)) (v_ArrVal_1875 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1876))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store .cse5 .cse4 v_ArrVal_1865))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1875) .cse4 v_ArrVal_1866) .cse2 v_ArrVal_1868))) (or (forall ((v_ArrVal_1867 (Array Int Int)) (v_ArrVal_1870 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_1867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 8) 0)))))))) (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1866 (Array Int Int)) (v_ArrVal_1876 (Array Int Int)) (v_ArrVal_1865 (Array Int Int)) (v_ArrVal_1875 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1876))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse12 .cse11 v_ArrVal_1865))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1875) .cse11 v_ArrVal_1866) .cse10 v_ArrVal_1868))) (or (forall ((v_ArrVal_1867 (Array Int Int)) (v_ArrVal_1870 (Array Int Int)) (v_ArrVal_1869 (Array Int Int))) (let ((.cse8 (store .cse9 .cse10 v_ArrVal_1867))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store .cse6 .cse7 v_ArrVal_1870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))) (< (+ (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 8) 0)))))))))) is different from false [2025-03-04 09:25:59,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126103682] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:59,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:25:59,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2025-03-04 09:25:59,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173446403] [2025-03-04 09:25:59,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:25:59,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 09:25:59,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:59,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 09:25:59,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=749, Unknown=10, NotChecked=236, Total=1122 [2025-03-04 09:25:59,483 INFO L87 Difference]: Start difference. First operand 680 states and 771 transitions. Second operand has 25 states, 22 states have (on average 7.136363636363637) internal successors, (157), 25 states have internal predecessors, (157), 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-04 09:26:01,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:26:01,414 INFO L93 Difference]: Finished difference Result 682 states and 775 transitions. [2025-03-04 09:26:01,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 09:26:01,415 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.136363636363637) internal successors, (157), 25 states have internal predecessors, (157), 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 97 [2025-03-04 09:26:01,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:26:01,416 INFO L225 Difference]: With dead ends: 682 [2025-03-04 09:26:01,416 INFO L226 Difference]: Without dead ends: 682 [2025-03-04 09:26:01,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=1129, Unknown=10, NotChecked=292, Total=1640 [2025-03-04 09:26:01,417 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 504 mSDsluCounter, 2752 mSDsCounter, 0 mSdLazyCounter, 3939 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 3073 SdHoareTripleChecker+Invalid, 3957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:26:01,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 3073 Invalid, 3957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3939 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 09:26:01,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-03-04 09:26:01,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 664. [2025-03-04 09:26:01,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 477 states have (on average 1.5681341719077568) internal successors, (748), 658 states have internal predecessors, (748), 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-04 09:26:01,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 754 transitions. [2025-03-04 09:26:01,422 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 754 transitions. Word has length 97 [2025-03-04 09:26:01,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:26:01,423 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 754 transitions. [2025-03-04 09:26:01,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.136363636363637) internal successors, (157), 25 states have internal predecessors, (157), 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-04 09:26:01,423 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 754 transitions. [2025-03-04 09:26:01,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 09:26:01,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:26:01,423 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-04 09:26:01,431 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-04 09:26:01,623 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,SelfDestructingSolverStorable26 [2025-03-04 09:26:01,624 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr204REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-04 09:26:01,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:26:01,624 INFO L85 PathProgramCache]: Analyzing trace with hash -279115982, now seen corresponding path program 1 times [2025-03-04 09:26:01,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:26:01,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145843878] [2025-03-04 09:26:01,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:01,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:26:01,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 09:26:01,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 09:26:01,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:01,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:02,119 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-04 09:26:02,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:26:02,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145843878] [2025-03-04 09:26:02,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145843878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:26:02,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:26:02,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 09:26:02,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428150306] [2025-03-04 09:26:02,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:26:02,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 09:26:02,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:26:02,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 09:26:02,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-03-04 09:26:02,121 INFO L87 Difference]: Start difference. First operand 664 states and 754 transitions. Second operand has 17 states, 15 states have (on average 6.533333333333333) internal successors, (98), 16 states have internal predecessors, (98), 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-04 09:26:03,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:26:03,114 INFO L93 Difference]: Finished difference Result 687 states and 780 transitions. [2025-03-04 09:26:03,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 09:26:03,115 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.533333333333333) internal successors, (98), 16 states have internal predecessors, (98), 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 100 [2025-03-04 09:26:03,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:26:03,117 INFO L225 Difference]: With dead ends: 687 [2025-03-04 09:26:03,117 INFO L226 Difference]: Without dead ends: 687 [2025-03-04 09:26:03,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2025-03-04 09:26:03,117 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 560 mSDsluCounter, 2118 mSDsCounter, 0 mSdLazyCounter, 2287 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 2436 SdHoareTripleChecker+Invalid, 2303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:26:03,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 2436 Invalid, 2303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2287 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 09:26:03,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-03-04 09:26:03,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 683. [2025-03-04 09:26:03,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 495 states have (on average 1.5515151515151515) internal successors, (768), 676 states have internal predecessors, (768), 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-04 09:26:03,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 775 transitions. [2025-03-04 09:26:03,125 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 775 transitions. Word has length 100 [2025-03-04 09:26:03,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:26:03,126 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 775 transitions. [2025-03-04 09:26:03,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.533333333333333) internal successors, (98), 16 states have internal predecessors, (98), 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-04 09:26:03,126 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 775 transitions. [2025-03-04 09:26:03,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 09:26:03,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:26:03,126 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-04 09:26:03,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 09:26:03,126 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr205REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-04 09:26:03,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:26:03,127 INFO L85 PathProgramCache]: Analyzing trace with hash -279115981, now seen corresponding path program 1 times [2025-03-04 09:26:03,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:26:03,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343000923] [2025-03-04 09:26:03,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:03,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:26:03,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 09:26:03,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 09:26:03,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:03,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:03,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:26:03,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:26:03,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343000923] [2025-03-04 09:26:03,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343000923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:26:03,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:26:03,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 09:26:03,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871277014] [2025-03-04 09:26:03,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:26:03,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 09:26:03,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:26:03,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 09:26:03,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-03-04 09:26:03,947 INFO L87 Difference]: Start difference. First operand 683 states and 775 transitions. Second operand has 18 states, 16 states have (on average 6.125) internal successors, (98), 17 states have internal predecessors, (98), 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-04 09:26:05,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:26:05,368 INFO L93 Difference]: Finished difference Result 686 states and 779 transitions. [2025-03-04 09:26:05,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 09:26:05,369 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.125) internal successors, (98), 17 states have internal predecessors, (98), 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 100 [2025-03-04 09:26:05,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:26:05,370 INFO L225 Difference]: With dead ends: 686 [2025-03-04 09:26:05,370 INFO L226 Difference]: Without dead ends: 686 [2025-03-04 09:26:05,371 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-04 09:26:05,371 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 538 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 2898 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 2320 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:26:05,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 2320 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2898 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 09:26:05,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-03-04 09:26:05,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 683. [2025-03-04 09:26:05,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 495 states have (on average 1.5494949494949495) internal successors, (767), 676 states have internal predecessors, (767), 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-04 09:26:05,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 774 transitions. [2025-03-04 09:26:05,376 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 774 transitions. Word has length 100 [2025-03-04 09:26:05,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:26:05,376 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 774 transitions. [2025-03-04 09:26:05,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.125) internal successors, (98), 17 states have internal predecessors, (98), 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-04 09:26:05,377 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 774 transitions. [2025-03-04 09:26:05,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 09:26:05,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:26:05,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:26:05,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 09:26:05,377 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-04 09:26:05,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:26:05,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1731711528, now seen corresponding path program 1 times [2025-03-04 09:26:05,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:26:05,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236317085] [2025-03-04 09:26:05,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:05,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:26:05,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 09:26:05,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 09:26:05,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:05,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:05,904 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-04 09:26:05,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:26:05,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236317085] [2025-03-04 09:26:05,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236317085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:26:05,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822011198] [2025-03-04 09:26:05,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:05,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:26:05,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:26:05,906 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-04 09:26:05,907 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-04 09:26:06,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 09:26:06,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 09:26:06,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:06,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:06,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 09:26:06,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:26:06,090 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-04 09:26:06,157 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:26:06,157 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-04 09:26:06,160 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-04 09:26:06,223 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:06,223 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-04 09:26:06,256 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:06,256 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-04 09:26:06,289 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:06,289 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-04 09:26:06,323 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:06,323 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-04 09:26:06,378 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:06,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 09:26:06,386 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-04 09:26:06,402 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 09:26:06,403 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-04 09:26:06,405 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-04 09:26:06,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:26:06,999 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2025-03-04 09:26:07,000 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-04 09:26:07,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822011198] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:26:07,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:26:07,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 23 [2025-03-04 09:26:07,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423066923] [2025-03-04 09:26:07,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:26:07,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 09:26:07,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:26:07,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 09:26:07,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=978, Unknown=58, NotChecked=0, Total=1190 [2025-03-04 09:26:07,107 INFO L87 Difference]: Start difference. First operand 683 states and 774 transitions. Second operand has 24 states, 21 states have (on average 7.380952380952381) internal successors, (155), 24 states have internal predecessors, (155), 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-04 09:26:09,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:26:09,042 INFO L93 Difference]: Finished difference Result 685 states and 778 transitions. [2025-03-04 09:26:09,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 09:26:09,042 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.380952380952381) internal successors, (155), 24 states have internal predecessors, (155), 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 101 [2025-03-04 09:26:09,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:26:09,044 INFO L225 Difference]: With dead ends: 685 [2025-03-04 09:26:09,044 INFO L226 Difference]: Without dead ends: 685 [2025-03-04 09:26:09,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=278, Invalid=1644, Unknown=58, NotChecked=0, Total=1980 [2025-03-04 09:26:09,044 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 497 mSDsluCounter, 3897 mSDsCounter, 0 mSdLazyCounter, 3894 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 4215 SdHoareTripleChecker+Invalid, 3912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 09:26:09,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 4215 Invalid, 3912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3894 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 09:26:09,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-03-04 09:26:09,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 682. [2025-03-04 09:26:09,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 495 states have (on average 1.5474747474747474) internal successors, (766), 675 states have internal predecessors, (766), 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-04 09:26:09,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 773 transitions. [2025-03-04 09:26:09,050 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 773 transitions. Word has length 101 [2025-03-04 09:26:09,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:26:09,050 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 773 transitions. [2025-03-04 09:26:09,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.380952380952381) internal successors, (155), 24 states have internal predecessors, (155), 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-04 09:26:09,050 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 773 transitions. [2025-03-04 09:26:09,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 09:26:09,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:26:09,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:26:09,058 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-04 09:26:09,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:26:09,251 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-04 09:26:09,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:26:09,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1731711529, now seen corresponding path program 1 times [2025-03-04 09:26:09,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:26:09,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605106580] [2025-03-04 09:26:09,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:09,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:26:09,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 09:26:09,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 09:26:09,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:09,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:09,972 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-04 09:26:09,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:26:09,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605106580] [2025-03-04 09:26:09,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605106580] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:26:09,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621335667] [2025-03-04 09:26:09,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:09,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:26:09,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:26:09,974 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-04 09:26:09,975 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-04 09:26:10,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 09:26:10,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 09:26:10,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:10,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:10,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-04 09:26:10,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:26:10,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 09:26:10,249 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-04 09:26:10,254 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:26:10,254 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-04 09:26:10,259 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-04 09:26:10,263 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-04 09:26:10,297 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-04 09:26:10,299 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-04 09:26:10,382 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:10,382 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-04 09:26:10,387 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-04 09:26:10,436 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:10,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 62 treesize of output 57 [2025-03-04 09:26:10,440 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-04 09:26:10,493 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:10,493 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-04 09:26:10,496 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-04 09:26:10,549 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:10,549 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-04 09:26:10,554 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-04 09:26:10,610 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:10,610 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-04 09:26:10,617 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-04 09:26:10,633 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-04 09:26:10,637 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-04 09:26:10,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:26:10,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-03-04 09:26:10,650 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:26:10,651 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-04 09:26:10,653 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-04 09:26:10,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:26:10,901 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (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_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2393) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 1)))) (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int) (v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (or (forall ((v_ArrVal_2397 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2394))) (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~mem55#1.base| v_ArrVal_2393) .cse1 v_ArrVal_2395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2397) (select (select (store .cse2 .cse1 v_ArrVal_2396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0)))))) is different from false [2025-03-04 09:26:10,917 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int) (v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0)) (forall ((v_ArrVal_2397 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2394))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2393) .cse1 v_ArrVal_2395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2397) (select (select (store .cse3 .cse1 v_ArrVal_2396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (or (forall ((v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2393) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 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))))))) is different from false [2025-03-04 09:26:10,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:26:10,964 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 172 treesize of output 190 [2025-03-04 09:26:11,046 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2391 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int)) (v_ArrVal_2392 (Array Int Int))) (< 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2391))) (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~mem54#1.base| v_ArrVal_2392) .cse0 v_ArrVal_2393) (select (select (store .cse1 .cse0 v_ArrVal_2394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2395))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1))) (forall ((v_prenex_23 Int)) (or (forall ((v_ArrVal_2397 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_prenex_22))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_prenex_25))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (< (+ 3 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_prenex_27) .cse3 v_prenex_26) .cse4 v_prenex_24) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| v_prenex_23 v_ArrVal_2397) (select (select (store .cse5 .cse4 v_ArrVal_2396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (= v_prenex_23 |c_ULTIMATE.start_main_#t~mem54#1.base|))))) is different from false [2025-03-04 09:26:11,071 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2391 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int)) (v_ArrVal_2392 (Array Int Int))) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2391))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2392) .cse1 v_ArrVal_2393) (select (select (store .cse2 .cse1 v_ArrVal_2394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2395))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))) (forall ((v_prenex_23 Int)) (or (forall ((v_ArrVal_2397 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_22))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_prenex_25))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (< (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_27) .cse4 v_prenex_26) .cse5 v_prenex_24) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 3) (select (store |c_#length| v_prenex_23 v_ArrVal_2397) (select (select (store .cse6 .cse5 v_ArrVal_2396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (= .cse0 v_prenex_23)))))) is different from false [2025-03-04 09:26:11,121 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2390 (Array Int Int)) (v_prenex_23 Int) (v_ArrVal_2389 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2390))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (= .cse0 v_prenex_23) (forall ((v_ArrVal_2397 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse5 (store .cse6 .cse0 v_prenex_22))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_prenex_25))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (< (+ 3 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2389) .cse0 v_prenex_27) .cse1 v_prenex_26) .cse2 v_prenex_24) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| v_prenex_23 v_ArrVal_2397) (select (select (store .cse4 .cse2 v_ArrVal_2396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) (forall ((v_ArrVal_2391 (Array Int Int)) (v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int)) (v_ArrVal_2392 (Array Int Int))) (< 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2390))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2391))) (let ((.cse8 (select (select .cse9 |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_2389) .cse7 v_ArrVal_2392) .cse8 v_ArrVal_2393) (select (select (store .cse9 .cse8 v_ArrVal_2394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2395))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))))) is different from false [2025-03-04 09:26:17,441 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2391 (Array Int Int)) (v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2403 (Array Int Int)) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int)) (v_ArrVal_2392 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2403))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2390))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2391))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2402) .cse0 v_ArrVal_2389) .cse1 v_ArrVal_2392) .cse2 v_ArrVal_2393) (select (select (store .cse3 .cse2 v_ArrVal_2394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2395))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2403 (Array Int Int)) (v_prenex_23 Int) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2389 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2403))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2390))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (forall ((v_ArrVal_2397 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse12 (store .cse13 .cse8 v_prenex_22))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_prenex_25))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 3 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2402) .cse7 v_ArrVal_2389) .cse8 v_prenex_27) .cse9 v_prenex_26) .cse10 v_prenex_24) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| v_prenex_23 v_ArrVal_2397) (select (select (store .cse11 .cse10 v_ArrVal_2396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))) (= v_prenex_23 .cse8))))))))) is different from false [2025-03-04 09:26:17,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621335667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:26:17,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:26:17,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 24 [2025-03-04 09:26:17,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325985226] [2025-03-04 09:26:17,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:26:17,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 09:26:17,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:26:17,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 09:26:17,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=805, Unknown=19, NotChecked=378, Total=1332 [2025-03-04 09:26:17,460 INFO L87 Difference]: Start difference. First operand 682 states and 773 transitions. Second operand has 25 states, 23 states have (on average 6.739130434782608) internal successors, (155), 24 states have internal predecessors, (155), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 09:26:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:26:40,879 INFO L93 Difference]: Finished difference Result 684 states and 777 transitions. [2025-03-04 09:26:40,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 09:26:40,879 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 6.739130434782608) internal successors, (155), 24 states have internal predecessors, (155), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-03-04 09:26:40,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:26:40,881 INFO L225 Difference]: With dead ends: 684 [2025-03-04 09:26:40,881 INFO L226 Difference]: Without dead ends: 684 [2025-03-04 09:26:40,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=249, Invalid=1562, Unknown=19, NotChecked=522, Total=2352 [2025-03-04 09:26:40,882 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 522 mSDsluCounter, 2732 mSDsCounter, 0 mSdLazyCounter, 3949 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 3049 SdHoareTripleChecker+Invalid, 3968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:26:40,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 3049 Invalid, 3968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3949 Invalid, 0 Unknown, 0 Unchecked, 21.3s Time] [2025-03-04 09:26:40,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-03-04 09:26:40,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 662. [2025-03-04 09:26:40,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 477 states have (on average 1.5639412997903563) internal successors, (746), 656 states have internal predecessors, (746), 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-04 09:26:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 752 transitions. [2025-03-04 09:26:40,887 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 752 transitions. Word has length 101 [2025-03-04 09:26:40,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:26:40,887 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 752 transitions. [2025-03-04 09:26:40,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 6.739130434782608) internal successors, (155), 24 states have internal predecessors, (155), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 09:26:40,887 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 752 transitions. [2025-03-04 09:26:40,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 09:26:40,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:26:40,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:26:40,895 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-04 09:26:41,088 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,SelfDestructingSolverStorable30 [2025-03-04 09:26:41,088 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr200REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-03-04 09:26:41,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:26:41,088 INFO L85 PathProgramCache]: Analyzing trace with hash -87123703, now seen corresponding path program 1 times [2025-03-04 09:26:41,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:26:41,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515679705] [2025-03-04 09:26:41,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:41,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:26:41,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 09:26:41,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 09:26:41,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:41,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:42,605 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-04 09:26:42,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:26:42,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515679705] [2025-03-04 09:26:42,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515679705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:26:42,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:26:42,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 09:26:42,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550421998] [2025-03-04 09:26:42,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:26:42,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 09:26:42,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:26:42,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 09:26:42,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-04 09:26:42,607 INFO L87 Difference]: Start difference. First operand 662 states and 752 transitions. Second operand has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 15 states have internal predecessors, (101), 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)