./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-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_test2-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 e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:25:29,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:25:29,912 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:29,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:25:29,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:25:29,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:25:29,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:25:29,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:25:29,937 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:25:29,937 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:25:29,937 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:25:29,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:25:29,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:25:29,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:25:29,938 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:25:29,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:25:29,938 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:25:29,938 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:25:29,938 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:25:29,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:25:29,938 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:25:29,938 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:25:29,938 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:25:29,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:25:29,939 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:25:29,939 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:25:29,939 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:25:29,939 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:25:29,939 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:25:29,939 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:25:29,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:25:29,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:25:29,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:25:29,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:25:29,939 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:25:29,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:25:29,940 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:25:29,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:25:29,940 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:25:29,940 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:25:29,940 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:25:29,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:25:29,940 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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2025-03-04 09:25:30,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:25:30,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:25:30,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:25:30,187 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:25:30,187 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:25:30,188 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_test2-1.i [2025-03-04 09:25:31,372 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae160d333/29ded3af7a90477cbdba3b1f94dbdde8/FLAGdd3eb1d7e [2025-03-04 09:25:31,712 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:25:31,713 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i [2025-03-04 09:25:31,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae160d333/29ded3af7a90477cbdba3b1f94dbdde8/FLAGdd3eb1d7e [2025-03-04 09:25:31,746 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae160d333/29ded3af7a90477cbdba3b1f94dbdde8 [2025-03-04 09:25:31,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:25:31,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:25:31,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:25:31,753 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:25:31,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:25:31,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:25:31" (1/1) ... [2025-03-04 09:25:31,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49deb0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:31, skipping insertion in model container [2025-03-04 09:25:31,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:25:31" (1/1) ... [2025-03-04 09:25:31,793 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:25:32,085 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:32,108 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:32,110 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:32,113 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:32,119 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:32,143 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:32,143 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:32,145 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:32,145 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:32,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:25:32,161 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:25:32,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:25:32,272 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:25:32,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:32 WrapperNode [2025-03-04 09:25:32,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:25:32,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:25:32,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:25:32,275 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:25:32,280 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:32" (1/1) ... [2025-03-04 09:25:32,305 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:32" (1/1) ... [2025-03-04 09:25:32,366 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1251 [2025-03-04 09:25:32,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:25:32,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:25:32,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:25:32,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:25:32,380 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:32" (1/1) ... [2025-03-04 09:25:32,380 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:32" (1/1) ... [2025-03-04 09:25:32,389 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:32" (1/1) ... [2025-03-04 09:25:32,440 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 34, 170]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2025-03-04 09:25:32,440 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:32" (1/1) ... [2025-03-04 09:25:32,440 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:32" (1/1) ... [2025-03-04 09:25:32,478 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:32" (1/1) ... [2025-03-04 09:25:32,481 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:32" (1/1) ... [2025-03-04 09:25:32,484 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:32" (1/1) ... [2025-03-04 09:25:32,486 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:32" (1/1) ... [2025-03-04 09:25:32,490 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:25:32,493 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:25:32,494 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:25:32,494 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:25:32,495 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:32" (1/1) ... [2025-03-04 09:25:32,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:25:32,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:25:32,524 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:32,529 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:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 09:25:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 09:25:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 09:25:32,542 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 09:25:32,543 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 09:25:32,543 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 09:25:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 09:25:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 09:25:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 09:25:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 09:25:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 09:25:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 09:25:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 09:25:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 09:25:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 09:25:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 09:25:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 09:25:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 09:25:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:25:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 09:25:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 09:25:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 09:25:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:25:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:25:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 09:25:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:25:32,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:25:32,689 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:25:32,690 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:25:34,107 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-04 09:25:34,195 INFO L? ?]: Removed 1028 outVars from TransFormulas that were not future-live. [2025-03-04 09:25:34,195 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:25:34,245 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:25:34,245 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 09:25:34,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:25:34 BoogieIcfgContainer [2025-03-04 09:25:34,245 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:25:34,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:25:34,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:25:34,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:25:34,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:25:31" (1/3) ... [2025-03-04 09:25:34,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf10873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:25:34, skipping insertion in model container [2025-03-04 09:25:34,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:25:32" (2/3) ... [2025-03-04 09:25:34,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf10873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:25:34, skipping insertion in model container [2025-03-04 09:25:34,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:25:34" (3/3) ... [2025-03-04 09:25:34,252 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test2-1.i [2025-03-04 09:25:34,262 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:25:34,264 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_nondet_test2-1.i that has 4 procedures, 1058 locations, 1 initial locations, 31 loop locations, and 420 error locations. [2025-03-04 09:25:34,313 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:25:34,322 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;@7cf9922a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:25:34,322 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2025-03-04 09:25:34,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 1048 states, 626 states have (on average 2.015974440894569) internal successors, (1262), 1043 states have internal predecessors, (1262), 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:34,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 09:25:34,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:34,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 09:25:34,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:34,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:34,337 INFO L85 PathProgramCache]: Analyzing trace with hash 41525260, now seen corresponding path program 1 times [2025-03-04 09:25:34,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:34,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063958911] [2025-03-04 09:25:34,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:34,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:34,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 09:25:34,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 09:25:34,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:34,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:34,519 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:34,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:34,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063958911] [2025-03-04 09:25:34,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063958911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:34,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:34,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:25:34,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004383395] [2025-03-04 09:25:34,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:34,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:25:34,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:34,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:25:34,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:25:34,545 INFO L87 Difference]: Start difference. First operand has 1048 states, 626 states have (on average 2.015974440894569) internal successors, (1262), 1043 states have internal predecessors, (1262), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:35,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:35,446 INFO L93 Difference]: Finished difference Result 1342 states and 1595 transitions. [2025-03-04 09:25:35,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:25:35,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 09:25:35,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:35,462 INFO L225 Difference]: With dead ends: 1342 [2025-03-04 09:25:35,462 INFO L226 Difference]: Without dead ends: 1338 [2025-03-04 09:25:35,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:25:35,467 INFO L435 NwaCegarLoop]: 1052 mSDtfsCounter, 380 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 2510 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:35,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 2510 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 09:25:35,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-03-04 09:25:35,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1253. [2025-03-04 09:25:35,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 837 states have (on average 1.8888888888888888) internal successors, (1581), 1248 states have internal predecessors, (1581), 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:35,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1587 transitions. [2025-03-04 09:25:35,553 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1587 transitions. Word has length 4 [2025-03-04 09:25:35,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:35,553 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 1587 transitions. [2025-03-04 09:25:35,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:35,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1587 transitions. [2025-03-04 09:25:35,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 09:25:35,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:35,554 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 09:25:35,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:25:35,554 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:35,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:35,555 INFO L85 PathProgramCache]: Analyzing trace with hash 41526588, now seen corresponding path program 1 times [2025-03-04 09:25:35,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:35,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076757444] [2025-03-04 09:25:35,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:35,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:35,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 09:25:35,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 09:25:35,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:35,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:35,597 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,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:35,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076757444] [2025-03-04 09:25:35,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076757444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:35,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:35,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:25:35,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592072595] [2025-03-04 09:25:35,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:35,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:25:35,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:35,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:25:35,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:25:35,599 INFO L87 Difference]: Start difference. First operand 1253 states and 1587 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:36,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:36,059 INFO L93 Difference]: Finished difference Result 1250 states and 1579 transitions. [2025-03-04 09:25:36,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:25:36,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 09:25:36,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:36,063 INFO L225 Difference]: With dead ends: 1250 [2025-03-04 09:25:36,064 INFO L226 Difference]: Without dead ends: 1250 [2025-03-04 09:25:36,064 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:36,065 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 1081 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:36,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 815 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 09:25:36,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2025-03-04 09:25:36,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2025-03-04 09:25:36,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 845 states have (on average 1.8615384615384616) internal successors, (1573), 1245 states have internal predecessors, (1573), 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:36,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1579 transitions. [2025-03-04 09:25:36,096 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1579 transitions. Word has length 4 [2025-03-04 09:25:36,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:36,097 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1579 transitions. [2025-03-04 09:25:36,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:36,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1579 transitions. [2025-03-04 09:25:36,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 09:25:36,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:36,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 09:25:36,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:25:36,098 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr419REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:36,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:36,098 INFO L85 PathProgramCache]: Analyzing trace with hash 41526589, now seen corresponding path program 1 times [2025-03-04 09:25:36,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:36,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961986597] [2025-03-04 09:25:36,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:36,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:36,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 09:25:36,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 09:25:36,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:36,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:36,181 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:36,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:36,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961986597] [2025-03-04 09:25:36,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961986597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:36,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:36,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:25:36,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824543791] [2025-03-04 09:25:36,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:36,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:25:36,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:36,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:25:36,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:25:36,182 INFO L87 Difference]: Start difference. First operand 1250 states and 1579 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:36,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:36,963 INFO L93 Difference]: Finished difference Result 2005 states and 2479 transitions. [2025-03-04 09:25:36,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:25:36,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 09:25:36,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:36,969 INFO L225 Difference]: With dead ends: 2005 [2025-03-04 09:25:36,969 INFO L226 Difference]: Without dead ends: 2005 [2025-03-04 09:25:36,969 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:36,970 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 899 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:36,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 1601 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 09:25:36,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2025-03-04 09:25:36,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1743. [2025-03-04 09:25:36,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1339 states have (on average 1.8356982823002241) internal successors, (2458), 1736 states have internal predecessors, (2458), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:25:36,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2468 transitions. [2025-03-04 09:25:36,996 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2468 transitions. Word has length 4 [2025-03-04 09:25:36,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:36,996 INFO L471 AbstractCegarLoop]: Abstraction has 1743 states and 2468 transitions. [2025-03-04 09:25:36,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:36,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2468 transitions. [2025-03-04 09:25:36,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 09:25:36,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:36,997 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:36,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:25:36,997 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr412REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:36,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:36,997 INFO L85 PathProgramCache]: Analyzing trace with hash -539402885, now seen corresponding path program 1 times [2025-03-04 09:25:36,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:36,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699539885] [2025-03-04 09:25:36,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:36,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:37,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:25:37,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:25:37,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:37,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:25:37,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:37,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699539885] [2025-03-04 09:25:37,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699539885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:37,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:37,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:25:37,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531900693] [2025-03-04 09:25:37,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:37,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:25:37,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:37,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:25:37,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:25:37,077 INFO L87 Difference]: Start difference. First operand 1743 states and 2468 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:37,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:37,614 INFO L93 Difference]: Finished difference Result 1781 states and 2399 transitions. [2025-03-04 09:25:37,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:25:37,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 09:25:37,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:37,619 INFO L225 Difference]: With dead ends: 1781 [2025-03-04 09:25:37,619 INFO L226 Difference]: Without dead ends: 1781 [2025-03-04 09:25:37,619 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:37,620 INFO L435 NwaCegarLoop]: 1055 mSDtfsCounter, 1066 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:37,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 1330 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:25:37,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2025-03-04 09:25:37,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1696. [2025-03-04 09:25:37,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 1339 states have (on average 1.782673637042569) internal successors, (2387), 1689 states have internal predecessors, (2387), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:25:37,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2397 transitions. [2025-03-04 09:25:37,647 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2397 transitions. Word has length 9 [2025-03-04 09:25:37,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:37,648 INFO L471 AbstractCegarLoop]: Abstraction has 1696 states and 2397 transitions. [2025-03-04 09:25:37,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:37,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2397 transitions. [2025-03-04 09:25:37,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 09:25:37,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:37,648 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:37,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:25:37,649 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr413REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:37,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:37,649 INFO L85 PathProgramCache]: Analyzing trace with hash -539402884, now seen corresponding path program 1 times [2025-03-04 09:25:37,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:37,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357357435] [2025-03-04 09:25:37,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:37,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:37,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:25:37,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:25:37,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:37,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:37,724 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:37,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:37,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357357435] [2025-03-04 09:25:37,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357357435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:37,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:37,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:25:37,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165318733] [2025-03-04 09:25:37,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:37,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:25:37,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:37,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:25:37,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:25:37,725 INFO L87 Difference]: Start difference. First operand 1696 states and 2397 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:38,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:38,224 INFO L93 Difference]: Finished difference Result 1987 states and 2739 transitions. [2025-03-04 09:25:38,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:25:38,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 09:25:38,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:38,233 INFO L225 Difference]: With dead ends: 1987 [2025-03-04 09:25:38,233 INFO L226 Difference]: Without dead ends: 1987 [2025-03-04 09:25:38,233 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:38,234 INFO L435 NwaCegarLoop]: 1185 mSDtfsCounter, 859 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:38,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 1574 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:25:38,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2025-03-04 09:25:38,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1671. [2025-03-04 09:25:38,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1339 states have (on average 1.7460791635548918) internal successors, (2338), 1664 states have internal predecessors, (2338), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:25:38,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2348 transitions. [2025-03-04 09:25:38,257 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2348 transitions. Word has length 9 [2025-03-04 09:25:38,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:38,257 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2348 transitions. [2025-03-04 09:25:38,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:38,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2348 transitions. [2025-03-04 09:25:38,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 09:25:38,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:38,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:38,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:25:38,258 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:38,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:38,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1139546303, now seen corresponding path program 1 times [2025-03-04 09:25:38,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:38,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008361189] [2025-03-04 09:25:38,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:38,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:38,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:25:38,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:25:38,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:38,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:38,307 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:38,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:38,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008361189] [2025-03-04 09:25:38,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008361189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:38,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:38,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:25:38,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836553781] [2025-03-04 09:25:38,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:38,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:25:38,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:38,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:25:38,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:25:38,309 INFO L87 Difference]: Start difference. First operand 1671 states and 2348 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:38,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:38,808 INFO L93 Difference]: Finished difference Result 1795 states and 2507 transitions. [2025-03-04 09:25:38,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:25:38,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-04 09:25:38,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:38,813 INFO L225 Difference]: With dead ends: 1795 [2025-03-04 09:25:38,813 INFO L226 Difference]: Without dead ends: 1795 [2025-03-04 09:25:38,813 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:38,814 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 1281 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:38,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 1318 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:25:38,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2025-03-04 09:25:38,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1648. [2025-03-04 09:25:38,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1339 states have (on average 1.6945481702763256) internal successors, (2269), 1641 states have internal predecessors, (2269), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:25:38,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2279 transitions. [2025-03-04 09:25:38,837 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2279 transitions. Word has length 13 [2025-03-04 09:25:38,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:38,837 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2279 transitions. [2025-03-04 09:25:38,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:38,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2279 transitions. [2025-03-04 09:25:38,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 09:25:38,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:38,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:38,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:25:38,838 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:38,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:38,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1139546304, now seen corresponding path program 1 times [2025-03-04 09:25:38,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:38,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553598907] [2025-03-04 09:25:38,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:38,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:38,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:25:38,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:25:38,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:38,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:38,907 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:38,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:38,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553598907] [2025-03-04 09:25:38,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553598907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:38,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:38,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:25:38,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132614312] [2025-03-04 09:25:38,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:38,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:25:38,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:38,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:25:38,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:25:38,909 INFO L87 Difference]: Start difference. First operand 1648 states and 2279 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:38,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:38,963 INFO L93 Difference]: Finished difference Result 1447 states and 1970 transitions. [2025-03-04 09:25:38,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:25:38,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-04 09:25:38,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:38,967 INFO L225 Difference]: With dead ends: 1447 [2025-03-04 09:25:38,967 INFO L226 Difference]: Without dead ends: 1447 [2025-03-04 09:25:38,967 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:38,968 INFO L435 NwaCegarLoop]: 946 mSDtfsCounter, 60 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1839 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:38,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1839 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:25:38,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2025-03-04 09:25:38,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1447. [2025-03-04 09:25:38,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1150 states have (on average 1.7043478260869565) internal successors, (1960), 1440 states have internal predecessors, (1960), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:25:38,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1970 transitions. [2025-03-04 09:25:38,989 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 1970 transitions. Word has length 13 [2025-03-04 09:25:38,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:38,990 INFO L471 AbstractCegarLoop]: Abstraction has 1447 states and 1970 transitions. [2025-03-04 09:25:38,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:38,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1970 transitions. [2025-03-04 09:25:38,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 09:25:38,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:38,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:38,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:25:38,990 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:38,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:38,990 INFO L85 PathProgramCache]: Analyzing trace with hash 966072339, now seen corresponding path program 1 times [2025-03-04 09:25:38,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:38,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318843527] [2025-03-04 09:25:38,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:38,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:38,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 09:25:39,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 09:25:39,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:39,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:39,049 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:39,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:39,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318843527] [2025-03-04 09:25:39,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318843527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:39,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:39,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:25:39,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895721245] [2025-03-04 09:25:39,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:39,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:25:39,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:39,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:25:39,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:25:39,051 INFO L87 Difference]: Start difference. First operand 1447 states and 1970 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:39,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:39,141 INFO L93 Difference]: Finished difference Result 1416 states and 1904 transitions. [2025-03-04 09:25:39,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:25:39,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-04 09:25:39,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:39,144 INFO L225 Difference]: With dead ends: 1416 [2025-03-04 09:25:39,144 INFO L226 Difference]: Without dead ends: 1416 [2025-03-04 09:25:39,144 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:39,145 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 45 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2701 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:39,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2701 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:25:39,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2025-03-04 09:25:39,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1416. [2025-03-04 09:25:39,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1126 states have (on average 1.6820603907637655) internal successors, (1894), 1409 states have internal predecessors, (1894), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:25:39,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1904 transitions. [2025-03-04 09:25:39,161 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 1904 transitions. Word has length 14 [2025-03-04 09:25:39,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:39,162 INFO L471 AbstractCegarLoop]: Abstraction has 1416 states and 1904 transitions. [2025-03-04 09:25:39,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:39,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1904 transitions. [2025-03-04 09:25:39,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 09:25:39,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:39,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:39,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:25:39,162 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr404REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:39,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:39,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2127185868, now seen corresponding path program 1 times [2025-03-04 09:25:39,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:39,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692664376] [2025-03-04 09:25:39,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:39,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:39,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 09:25:39,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:25:39,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:39,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:39,222 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:39,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:39,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692664376] [2025-03-04 09:25:39,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692664376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:39,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:39,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:25:39,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539760383] [2025-03-04 09:25:39,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:39,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:25:39,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:39,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:25:39,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:25:39,223 INFO L87 Difference]: Start difference. First operand 1416 states and 1904 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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:39,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:39,714 INFO L93 Difference]: Finished difference Result 1534 states and 2012 transitions. [2025-03-04 09:25:39,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:25:39,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2025-03-04 09:25:39,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:39,718 INFO L225 Difference]: With dead ends: 1534 [2025-03-04 09:25:39,718 INFO L226 Difference]: Without dead ends: 1534 [2025-03-04 09:25:39,718 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:39,718 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 1177 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:39,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 1565 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:25:39,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2025-03-04 09:25:39,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1393. [2025-03-04 09:25:39,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1126 states have (on average 1.641207815275311) internal successors, (1848), 1386 states have internal predecessors, (1848), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:25:39,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1858 transitions. [2025-03-04 09:25:39,733 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1858 transitions. Word has length 18 [2025-03-04 09:25:39,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:39,734 INFO L471 AbstractCegarLoop]: Abstraction has 1393 states and 1858 transitions. [2025-03-04 09:25:39,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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:39,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1858 transitions. [2025-03-04 09:25:39,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 09:25:39,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:39,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:39,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:25:39,734 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr405REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:39,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:39,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2127185869, now seen corresponding path program 1 times [2025-03-04 09:25:39,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:39,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870258193] [2025-03-04 09:25:39,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:39,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:39,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 09:25:39,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:25:39,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:39,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:39,791 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:39,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:39,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870258193] [2025-03-04 09:25:39,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870258193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:39,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:39,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:25:39,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079769050] [2025-03-04 09:25:39,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:39,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:25:39,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:39,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:25:39,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:25:39,792 INFO L87 Difference]: Start difference. First operand 1393 states and 1858 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:39,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:39,836 INFO L93 Difference]: Finished difference Result 1255 states and 1652 transitions. [2025-03-04 09:25:39,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:25:39,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2025-03-04 09:25:39,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:39,838 INFO L225 Difference]: With dead ends: 1255 [2025-03-04 09:25:39,838 INFO L226 Difference]: Without dead ends: 1255 [2025-03-04 09:25:39,839 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:39,839 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 60 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:39,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1549 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:25:39,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-03-04 09:25:39,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2025-03-04 09:25:39,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1000 states have (on average 1.642) internal successors, (1642), 1248 states have internal predecessors, (1642), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:25:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1652 transitions. [2025-03-04 09:25:39,852 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1652 transitions. Word has length 18 [2025-03-04 09:25:39,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:39,852 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1652 transitions. [2025-03-04 09:25:39,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:39,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1652 transitions. [2025-03-04 09:25:39,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 09:25:39,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:39,852 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:39,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:25:39,852 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr381REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:39,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:39,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1518128626, now seen corresponding path program 1 times [2025-03-04 09:25:39,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:39,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197852357] [2025-03-04 09:25:39,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:39,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:39,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:25:39,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:25:39,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:39,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:39,901 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:39,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:39,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197852357] [2025-03-04 09:25:39,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197852357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:39,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:39,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:25:39,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412193042] [2025-03-04 09:25:39,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:39,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:25:39,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:39,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:25:39,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:25:39,902 INFO L87 Difference]: Start difference. First operand 1255 states and 1652 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:39,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:39,975 INFO L93 Difference]: Finished difference Result 1226 states and 1602 transitions. [2025-03-04 09:25:39,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:25:39,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-04 09:25:39,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:39,978 INFO L225 Difference]: With dead ends: 1226 [2025-03-04 09:25:39,978 INFO L226 Difference]: Without dead ends: 1226 [2025-03-04 09:25:39,979 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:39,979 INFO L435 NwaCegarLoop]: 766 mSDtfsCounter, 41 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2270 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:39,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2270 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:25:39,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2025-03-04 09:25:39,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1220. [2025-03-04 09:25:39,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1220 states, 972 states have (on average 1.631687242798354) internal successors, (1586), 1213 states have internal predecessors, (1586), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:25:39,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1596 transitions. [2025-03-04 09:25:39,992 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1596 transitions. Word has length 19 [2025-03-04 09:25:39,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:39,992 INFO L471 AbstractCegarLoop]: Abstraction has 1220 states and 1596 transitions. [2025-03-04 09:25:39,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:39,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1596 transitions. [2025-03-04 09:25:39,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 09:25:39,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:39,993 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:39,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:25:39,993 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:39,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:39,993 INFO L85 PathProgramCache]: Analyzing trace with hash -2055582743, now seen corresponding path program 1 times [2025-03-04 09:25:39,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:39,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190839499] [2025-03-04 09:25:39,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:39,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:40,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 09:25:40,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 09:25:40,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:40,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:40,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:25:40,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:40,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190839499] [2025-03-04 09:25:40,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190839499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:40,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:40,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:25:40,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036396938] [2025-03-04 09:25:40,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:40,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:25:40,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:40,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:25:40,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:25:40,124 INFO L87 Difference]: Start difference. First operand 1220 states and 1596 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:40,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:40,731 INFO L93 Difference]: Finished difference Result 1442 states and 1749 transitions. [2025-03-04 09:25:40,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:25:40,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-04 09:25:40,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:40,735 INFO L225 Difference]: With dead ends: 1442 [2025-03-04 09:25:40,735 INFO L226 Difference]: Without dead ends: 1442 [2025-03-04 09:25:40,735 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:40,735 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 697 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:40,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1547 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 09:25:40,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2025-03-04 09:25:40,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1220. [2025-03-04 09:25:40,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1220 states, 972 states have (on average 1.623456790123457) internal successors, (1578), 1213 states have internal predecessors, (1578), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:25:40,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1588 transitions. [2025-03-04 09:25:40,747 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1588 transitions. Word has length 28 [2025-03-04 09:25:40,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:40,747 INFO L471 AbstractCegarLoop]: Abstraction has 1220 states and 1588 transitions. [2025-03-04 09:25:40,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:40,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1588 transitions. [2025-03-04 09:25:40,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 09:25:40,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:40,747 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] [2025-03-04 09:25:40,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:25:40,748 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr367REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:40,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:40,748 INFO L85 PathProgramCache]: Analyzing trace with hash 312594952, now seen corresponding path program 1 times [2025-03-04 09:25:40,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:40,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704684345] [2025-03-04 09:25:40,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:40,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:40,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 09:25:40,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 09:25:40,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:40,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:40,855 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:40,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:40,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704684345] [2025-03-04 09:25:40,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704684345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:40,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:40,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:25:40,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165900759] [2025-03-04 09:25:40,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:40,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:25:40,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:40,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:25:40,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:25:40,856 INFO L87 Difference]: Start difference. First operand 1220 states and 1588 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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:41,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:41,395 INFO L93 Difference]: Finished difference Result 1798 states and 2380 transitions. [2025-03-04 09:25:41,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:25:41,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2025-03-04 09:25:41,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:41,399 INFO L225 Difference]: With dead ends: 1798 [2025-03-04 09:25:41,399 INFO L226 Difference]: Without dead ends: 1798 [2025-03-04 09:25:41,399 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:41,399 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 655 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:41,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 1809 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:25:41,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2025-03-04 09:25:41,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1216. [2025-03-04 09:25:41,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 972 states have (on average 1.6152263374485596) internal successors, (1570), 1209 states have internal predecessors, (1570), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:25:41,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1580 transitions. [2025-03-04 09:25:41,411 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1580 transitions. Word has length 33 [2025-03-04 09:25:41,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:41,411 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1580 transitions. [2025-03-04 09:25:41,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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:41,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1580 transitions. [2025-03-04 09:25:41,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 09:25:41,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:41,412 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:41,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 09:25:41,412 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:41,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:41,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1634634434, now seen corresponding path program 1 times [2025-03-04 09:25:41,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:41,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426664073] [2025-03-04 09:25:41,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:41,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:41,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 09:25:41,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 09:25:41,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:41,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:41,508 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,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:41,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426664073] [2025-03-04 09:25:41,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426664073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:41,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:41,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:25:41,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75625728] [2025-03-04 09:25:41,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:41,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:25:41,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:41,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:25:41,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:25:41,509 INFO L87 Difference]: Start difference. First operand 1216 states and 1580 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:41,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:41,577 INFO L93 Difference]: Finished difference Result 1198 states and 1550 transitions. [2025-03-04 09:25:41,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:25:41,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-04 09:25:41,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:41,580 INFO L225 Difference]: With dead ends: 1198 [2025-03-04 09:25:41,580 INFO L226 Difference]: Without dead ends: 1198 [2025-03-04 09:25:41,580 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:41,581 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 27 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:41,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2246 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:25:41,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2025-03-04 09:25:41,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2025-03-04 09:25:41,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 954 states have (on average 1.6142557651991614) internal successors, (1540), 1191 states have internal predecessors, (1540), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:25:41,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1550 transitions. [2025-03-04 09:25:41,594 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1550 transitions. Word has length 60 [2025-03-04 09:25:41,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:41,594 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1550 transitions. [2025-03-04 09:25:41,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:41,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1550 transitions. [2025-03-04 09:25:41,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 09:25:41,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:41,596 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] [2025-03-04 09:25:41,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 09:25:41,596 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr352REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:41,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:41,597 INFO L85 PathProgramCache]: Analyzing trace with hash 30579484, now seen corresponding path program 1 times [2025-03-04 09:25:41,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:41,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143690592] [2025-03-04 09:25:41,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:41,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:41,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 09:25:41,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 09:25:41,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:41,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:41,682 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,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:41,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143690592] [2025-03-04 09:25:41,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143690592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:41,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:41,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:25:41,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488321069] [2025-03-04 09:25:41,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:41,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:25:41,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:41,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:25:41,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:25:41,683 INFO L87 Difference]: Start difference. First operand 1198 states and 1550 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:41,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:41,748 INFO L93 Difference]: Finished difference Result 1198 states and 1542 transitions. [2025-03-04 09:25:41,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:25:41,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 67 [2025-03-04 09:25:41,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:41,751 INFO L225 Difference]: With dead ends: 1198 [2025-03-04 09:25:41,751 INFO L226 Difference]: Without dead ends: 1198 [2025-03-04 09:25:41,751 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:41,751 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 21 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2240 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:41,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2240 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:25:41,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2025-03-04 09:25:41,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2025-03-04 09:25:41,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 954 states have (on average 1.6058700209643606) internal successors, (1532), 1191 states have internal predecessors, (1532), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:25:41,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1542 transitions. [2025-03-04 09:25:41,761 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1542 transitions. Word has length 67 [2025-03-04 09:25:41,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:41,761 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1542 transitions. [2025-03-04 09:25:41,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:41,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1542 transitions. [2025-03-04 09:25:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 09:25:41,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:41,762 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:41,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 09:25:41,762 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:41,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:41,762 INFO L85 PathProgramCache]: Analyzing trace with hash -593930742, now seen corresponding path program 1 times [2025-03-04 09:25:41,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:41,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923767699] [2025-03-04 09:25:41,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:41,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:41,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 09:25:41,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 09:25:41,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:41,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:41,838 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,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:41,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923767699] [2025-03-04 09:25:41,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923767699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:41,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:41,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:25:41,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962898583] [2025-03-04 09:25:41,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:41,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:25:41,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:41,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:25:41,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:25:41,839 INFO L87 Difference]: Start difference. First operand 1198 states and 1542 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:41,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:41,921 INFO L93 Difference]: Finished difference Result 1457 states and 1839 transitions. [2025-03-04 09:25:41,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:25:41,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-04 09:25:41,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:41,928 INFO L225 Difference]: With dead ends: 1457 [2025-03-04 09:25:41,928 INFO L226 Difference]: Without dead ends: 1457 [2025-03-04 09:25:41,928 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:41,928 INFO L435 NwaCegarLoop]: 778 mSDtfsCounter, 199 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:41,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1503 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:25:41,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2025-03-04 09:25:41,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1444. [2025-03-04 09:25:41,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1200 states have (on average 1.5208333333333333) internal successors, (1825), 1437 states have internal predecessors, (1825), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:25:41,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1835 transitions. [2025-03-04 09:25:41,943 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1835 transitions. Word has length 68 [2025-03-04 09:25:41,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:41,944 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1835 transitions. [2025-03-04 09:25:41,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:25:41,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1835 transitions. [2025-03-04 09:25:41,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 09:25:41,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:41,944 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] [2025-03-04 09:25:41,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 09:25:41,944 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:41,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:41,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1205711771, now seen corresponding path program 1 times [2025-03-04 09:25:41,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:41,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117880350] [2025-03-04 09:25:41,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:41,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:41,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 09:25:41,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 09:25:41,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:41,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:42,219 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,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:42,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117880350] [2025-03-04 09:25:42,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117880350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:42,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:42,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 09:25:42,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827245465] [2025-03-04 09:25:42,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:42,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:25:42,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:42,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:25:42,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:25:42,220 INFO L87 Difference]: Start difference. First operand 1444 states and 1835 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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:42,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:42,414 INFO L93 Difference]: Finished difference Result 2061 states and 2565 transitions. [2025-03-04 09:25:42,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:25:42,414 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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 74 [2025-03-04 09:25:42,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:42,418 INFO L225 Difference]: With dead ends: 2061 [2025-03-04 09:25:42,418 INFO L226 Difference]: Without dead ends: 2058 [2025-03-04 09:25:42,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 09:25:42,419 INFO L435 NwaCegarLoop]: 972 mSDtfsCounter, 722 mSDsluCounter, 3630 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 4602 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:42,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 4602 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:25:42,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2025-03-04 09:25:42,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 1347. [2025-03-04 09:25:42,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 1103 states have (on average 1.540344514959202) internal successors, (1699), 1340 states have internal predecessors, (1699), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:25:42,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1709 transitions. [2025-03-04 09:25:42,435 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1709 transitions. Word has length 74 [2025-03-04 09:25:42,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:42,435 INFO L471 AbstractCegarLoop]: Abstraction has 1347 states and 1709 transitions. [2025-03-04 09:25:42,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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:42,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1709 transitions. [2025-03-04 09:25:42,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 09:25:42,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:42,436 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] [2025-03-04 09:25:42,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 09:25:42,436 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:42,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:42,437 INFO L85 PathProgramCache]: Analyzing trace with hash -935803664, now seen corresponding path program 1 times [2025-03-04 09:25:42,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:42,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209478769] [2025-03-04 09:25:42,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:42,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:42,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 09:25:42,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 09:25:42,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:42,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:42,677 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,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:42,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209478769] [2025-03-04 09:25:42,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209478769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:42,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:42,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:25:42,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827340656] [2025-03-04 09:25:42,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:42,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:25:42,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:42,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:25:42,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:25:42,678 INFO L87 Difference]: Start difference. First operand 1347 states and 1709 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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:43,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:43,240 INFO L93 Difference]: Finished difference Result 1346 states and 1707 transitions. [2025-03-04 09:25:43,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:25:43,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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 83 [2025-03-04 09:25:43,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:43,243 INFO L225 Difference]: With dead ends: 1346 [2025-03-04 09:25:43,243 INFO L226 Difference]: Without dead ends: 1346 [2025-03-04 09:25:43,243 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:43,243 INFO L435 NwaCegarLoop]: 767 mSDtfsCounter, 2 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:43,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2215 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:25:43,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2025-03-04 09:25:43,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1346. [2025-03-04 09:25:43,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1103 states have (on average 1.5385312783318223) internal successors, (1697), 1339 states have internal predecessors, (1697), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:25:43,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1707 transitions. [2025-03-04 09:25:43,265 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1707 transitions. Word has length 83 [2025-03-04 09:25:43,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:43,265 INFO L471 AbstractCegarLoop]: Abstraction has 1346 states and 1707 transitions. [2025-03-04 09:25:43,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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:43,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1707 transitions. [2025-03-04 09:25:43,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 09:25:43,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:43,266 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] [2025-03-04 09:25:43,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 09:25:43,266 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr317REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:43,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:43,266 INFO L85 PathProgramCache]: Analyzing trace with hash -935803663, now seen corresponding path program 1 times [2025-03-04 09:25:43,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:43,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434807718] [2025-03-04 09:25:43,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:43,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:43,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 09:25:43,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 09:25:43,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:43,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:43,572 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:43,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:43,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434807718] [2025-03-04 09:25:43,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434807718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:43,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:43,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:25:43,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311193070] [2025-03-04 09:25:43,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:43,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:25:43,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:43,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:25:43,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:25:43,575 INFO L87 Difference]: Start difference. First operand 1346 states and 1707 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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:44,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:44,155 INFO L93 Difference]: Finished difference Result 1345 states and 1705 transitions. [2025-03-04 09:25:44,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:25:44,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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 83 [2025-03-04 09:25:44,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:44,158 INFO L225 Difference]: With dead ends: 1345 [2025-03-04 09:25:44,158 INFO L226 Difference]: Without dead ends: 1345 [2025-03-04 09:25:44,158 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:44,159 INFO L435 NwaCegarLoop]: 767 mSDtfsCounter, 1 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2141 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:44,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2141 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 09:25:44,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2025-03-04 09:25:44,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1345. [2025-03-04 09:25:44,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1101 states have (on average 1.5395095367847411) internal successors, (1695), 1338 states have internal predecessors, (1695), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:25:44,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1705 transitions. [2025-03-04 09:25:44,178 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1705 transitions. Word has length 83 [2025-03-04 09:25:44,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:44,178 INFO L471 AbstractCegarLoop]: Abstraction has 1345 states and 1705 transitions. [2025-03-04 09:25:44,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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:44,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1705 transitions. [2025-03-04 09:25:44,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 09:25:44,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:44,179 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:44,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 09:25:44,180 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:44,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:44,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1682388205, now seen corresponding path program 1 times [2025-03-04 09:25:44,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:44,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443667539] [2025-03-04 09:25:44,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:44,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:44,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 09:25:44,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 09:25:44,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:44,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:44,363 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:44,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:44,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443667539] [2025-03-04 09:25:44,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443667539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:44,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:44,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:25:44,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381529327] [2025-03-04 09:25:44,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:44,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:25:44,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:44,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:25:44,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:25:44,364 INFO L87 Difference]: Start difference. First operand 1345 states and 1705 transitions. Second operand has 7 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:25:44,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:44,907 INFO L93 Difference]: Finished difference Result 1363 states and 1731 transitions. [2025-03-04 09:25:44,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:25:44,907 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2025-03-04 09:25:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:44,911 INFO L225 Difference]: With dead ends: 1363 [2025-03-04 09:25:44,911 INFO L226 Difference]: Without dead ends: 1363 [2025-03-04 09:25:44,911 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:44,911 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 6 mSDsluCounter, 2224 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2983 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:44,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2983 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 09:25:44,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2025-03-04 09:25:44,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1354. [2025-03-04 09:25:44,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1109 states have (on average 1.5383228133453561) internal successors, (1706), 1345 states have internal predecessors, (1706), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-04 09:25:44,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1721 transitions. [2025-03-04 09:25:44,924 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1721 transitions. Word has length 91 [2025-03-04 09:25:44,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:44,924 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1721 transitions. [2025-03-04 09:25:44,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:25:44,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1721 transitions. [2025-03-04 09:25:44,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 09:25:44,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:44,924 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:44,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 09:25:44,925 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:44,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:44,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1682388206, now seen corresponding path program 1 times [2025-03-04 09:25:44,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:44,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643375885] [2025-03-04 09:25:44,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:44,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:44,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 09:25:44,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 09:25:44,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:44,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:45,268 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:45,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:45,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643375885] [2025-03-04 09:25:45,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643375885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:45,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:45,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:25:45,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053869245] [2025-03-04 09:25:45,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:45,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:25:45,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:45,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:25:45,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:25:45,269 INFO L87 Difference]: Start difference. First operand 1354 states and 1721 transitions. Second operand has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:25:45,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:45,887 INFO L93 Difference]: Finished difference Result 1354 states and 1719 transitions. [2025-03-04 09:25:45,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:25:45,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2025-03-04 09:25:45,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:45,891 INFO L225 Difference]: With dead ends: 1354 [2025-03-04 09:25:45,891 INFO L226 Difference]: Without dead ends: 1354 [2025-03-04 09:25:45,891 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:45,891 INFO L435 NwaCegarLoop]: 763 mSDtfsCounter, 1 mSDsluCounter, 2021 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2784 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:45,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2784 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 09:25:45,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2025-03-04 09:25:45,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1354. [2025-03-04 09:25:45,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1109 states have (on average 1.5365193868349865) internal successors, (1704), 1345 states have internal predecessors, (1704), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-04 09:25:45,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1719 transitions. [2025-03-04 09:25:45,906 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1719 transitions. Word has length 91 [2025-03-04 09:25:45,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:45,907 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1719 transitions. [2025-03-04 09:25:45,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:25:45,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1719 transitions. [2025-03-04 09:25:45,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 09:25:45,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:45,907 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:45,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 09:25:45,907 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:45,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:45,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1558078027, now seen corresponding path program 1 times [2025-03-04 09:25:45,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:45,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035440714] [2025-03-04 09:25:45,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:45,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:45,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 09:25:45,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 09:25:45,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:45,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:46,319 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,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:46,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035440714] [2025-03-04 09:25:46,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035440714] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:46,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531531145] [2025-03-04 09:25:46,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:46,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:25:46,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:25:46,322 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:46,324 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:46,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 09:25:46,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 09:25:46,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:46,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:46,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 09:25:46,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:25:46,507 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,615 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:25:46,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 09:25:46,647 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,716 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,888 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:46,889 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:46,936 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,973 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,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:25:47,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531531145] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:47,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:25:47,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2025-03-04 09:25:47,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573488270] [2025-03-04 09:25:47,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:25:47,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 09:25:47,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:47,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 09:25:47,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=315, Unknown=9, NotChecked=0, Total=380 [2025-03-04 09:25:47,030 INFO L87 Difference]: Start difference. First operand 1354 states and 1719 transitions. Second operand has 19 states, 16 states have (on average 9.0) internal successors, (144), 18 states have internal predecessors, (144), 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:25:48,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:48,577 INFO L93 Difference]: Finished difference Result 1361 states and 1725 transitions. [2025-03-04 09:25:48,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:25:48,580 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.0) internal successors, (144), 18 states have internal predecessors, (144), 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 92 [2025-03-04 09:25:48,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:48,582 INFO L225 Difference]: With dead ends: 1361 [2025-03-04 09:25:48,582 INFO L226 Difference]: Without dead ends: 1361 [2025-03-04 09:25:48,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=458, Unknown=11, NotChecked=0, Total=552 [2025-03-04 09:25:48,583 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 705 mSDsluCounter, 4573 mSDsCounter, 0 mSdLazyCounter, 3648 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 5045 SdHoareTripleChecker+Invalid, 3663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:48,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 5045 Invalid, 3663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3648 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 09:25:48,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2025-03-04 09:25:48,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1358. [2025-03-04 09:25:48,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1113 states have (on average 1.5336927223719676) internal successors, (1707), 1348 states have internal predecessors, (1707), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:25:48,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1719 transitions. [2025-03-04 09:25:48,595 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1719 transitions. Word has length 92 [2025-03-04 09:25:48,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:48,596 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 1719 transitions. [2025-03-04 09:25:48,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.0) internal successors, (144), 18 states have internal predecessors, (144), 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:25:48,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1719 transitions. [2025-03-04 09:25:48,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 09:25:48,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:48,597 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:48,604 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:48,797 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,SelfDestructingSolverStorable21 [2025-03-04 09:25:48,797 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:48,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:48,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1558078026, now seen corresponding path program 1 times [2025-03-04 09:25:48,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:48,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124491836] [2025-03-04 09:25:48,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:48,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:48,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 09:25:48,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 09:25:48,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:48,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:49,238 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:49,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:49,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124491836] [2025-03-04 09:25:49,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124491836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:49,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572627757] [2025-03-04 09:25:49,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:49,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:25:49,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:25:49,241 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:49,243 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:49,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 09:25:49,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 09:25:49,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:49,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:49,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 09:25:49,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:25:49,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:49,497 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:25:49,497 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:49,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 09:25:49,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 09:25:49,518 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:49,564 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:49,567 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:49,643 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:49,644 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:49,650 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:49,667 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:49,670 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:49,672 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:49,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:25:49,734 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_775 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_775) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))) (forall ((v_ArrVal_776 (Array Int Int)) (v_ArrVal_775 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_775) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_776) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-04 09:25:49,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572627757] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:49,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:25:49,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2025-03-04 09:25:49,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412160805] [2025-03-04 09:25:49,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:25:49,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 09:25:49,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:49,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 09:25:49,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2025-03-04 09:25:49,736 INFO L87 Difference]: Start difference. First operand 1358 states and 1719 transitions. Second operand has 15 states, 12 states have (on average 11.5) internal successors, (138), 15 states have internal predecessors, (138), 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:25:51,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:51,439 INFO L93 Difference]: Finished difference Result 1360 states and 1723 transitions. [2025-03-04 09:25:51,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:25:51,439 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 11.5) internal successors, (138), 15 states have internal predecessors, (138), 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 92 [2025-03-04 09:25:51,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:51,441 INFO L225 Difference]: With dead ends: 1360 [2025-03-04 09:25:51,441 INFO L226 Difference]: Without dead ends: 1360 [2025-03-04 09:25:51,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2025-03-04 09:25:51,442 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 698 mSDsluCounter, 3904 mSDsCounter, 0 mSdLazyCounter, 4258 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 4379 SdHoareTripleChecker+Invalid, 4271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:51,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 4379 Invalid, 4271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4258 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 09:25:51,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2025-03-04 09:25:51,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1348. [2025-03-04 09:25:51,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1105 states have (on average 1.5348416289592761) internal successors, (1696), 1340 states have internal predecessors, (1696), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:25:51,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1706 transitions. [2025-03-04 09:25:51,452 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1706 transitions. Word has length 92 [2025-03-04 09:25:51,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:51,452 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 1706 transitions. [2025-03-04 09:25:51,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 11.5) internal successors, (138), 15 states have internal predecessors, (138), 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:25:51,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1706 transitions. [2025-03-04 09:25:51,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 09:25:51,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:51,453 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:51,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 09:25:51,657 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,SelfDestructingSolverStorable22 [2025-03-04 09:25:51,657 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:51,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:51,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2054499956, now seen corresponding path program 1 times [2025-03-04 09:25:51,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:51,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238998839] [2025-03-04 09:25:51,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:51,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:51,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 09:25:51,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 09:25:51,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:51,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:51,961 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:51,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:51,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238998839] [2025-03-04 09:25:51,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238998839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:51,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:51,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 09:25:51,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449882792] [2025-03-04 09:25:51,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:51,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 09:25:51,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:51,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 09:25:51,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:25:51,962 INFO L87 Difference]: Start difference. First operand 1348 states and 1706 transitions. Second operand has 14 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:25:52,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:52,939 INFO L93 Difference]: Finished difference Result 1367 states and 1731 transitions. [2025-03-04 09:25:52,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 09:25:52,940 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2025-03-04 09:25:52,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:52,942 INFO L225 Difference]: With dead ends: 1367 [2025-03-04 09:25:52,942 INFO L226 Difference]: Without dead ends: 1367 [2025-03-04 09:25:52,942 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:52,942 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 716 mSDsluCounter, 3227 mSDsCounter, 0 mSdLazyCounter, 2653 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 3699 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:52,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 3699 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2653 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 09:25:52,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2025-03-04 09:25:52,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1363. [2025-03-04 09:25:52,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1119 states have (on average 1.5308310991957104) internal successors, (1713), 1353 states have internal predecessors, (1713), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:25:52,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1725 transitions. [2025-03-04 09:25:52,953 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1725 transitions. Word has length 94 [2025-03-04 09:25:52,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:52,953 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 1725 transitions. [2025-03-04 09:25:52,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:25:52,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1725 transitions. [2025-03-04 09:25:52,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 09:25:52,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:52,955 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:52,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 09:25:52,955 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr309REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:52,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:52,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2054499957, now seen corresponding path program 1 times [2025-03-04 09:25:52,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:52,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890820010] [2025-03-04 09:25:52,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:52,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:52,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 09:25:52,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 09:25:52,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:52,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:53,373 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:53,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:53,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890820010] [2025-03-04 09:25:53,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890820010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:25:53,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:25:53,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 09:25:53,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729532212] [2025-03-04 09:25:53,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:25:53,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 09:25:53,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:53,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 09:25:53,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 09:25:53,374 INFO L87 Difference]: Start difference. First operand 1363 states and 1725 transitions. Second operand has 11 states, 10 states have (on average 9.2) internal successors, (92), 11 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:25:54,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:54,261 INFO L93 Difference]: Finished difference Result 1366 states and 1729 transitions. [2025-03-04 09:25:54,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:25:54,261 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.2) internal successors, (92), 11 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2025-03-04 09:25:54,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:54,263 INFO L225 Difference]: With dead ends: 1366 [2025-03-04 09:25:54,263 INFO L226 Difference]: Without dead ends: 1366 [2025-03-04 09:25:54,264 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:54,264 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 709 mSDsluCounter, 1967 mSDsCounter, 0 mSdLazyCounter, 2325 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 2443 SdHoareTripleChecker+Invalid, 2336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:54,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 2443 Invalid, 2336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2325 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 09:25:54,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2025-03-04 09:25:54,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1363. [2025-03-04 09:25:54,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1119 states have (on average 1.5290437890974085) internal successors, (1711), 1353 states have internal predecessors, (1711), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:25:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1723 transitions. [2025-03-04 09:25:54,288 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1723 transitions. Word has length 94 [2025-03-04 09:25:54,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:54,288 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 1723 transitions. [2025-03-04 09:25:54,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.2) internal successors, (92), 11 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:25:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1723 transitions. [2025-03-04 09:25:54,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 09:25:54,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:54,289 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:54,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 09:25:54,289 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:54,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:54,289 INFO L85 PathProgramCache]: Analyzing trace with hash -990072660, now seen corresponding path program 1 times [2025-03-04 09:25:54,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:54,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252947356] [2025-03-04 09:25:54,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:54,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:54,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 09:25:54,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 09:25:54,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:54,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:54,624 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:54,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:54,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252947356] [2025-03-04 09:25:54,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252947356] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:54,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750247520] [2025-03-04 09:25:54,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:54,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:25:54,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:25:54,627 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:54,629 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:54,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 09:25:54,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 09:25:54,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:54,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:54,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 09:25:54,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:25:54,802 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:54,895 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:25:54,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 09:25:54,923 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:54,973 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:55,095 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:55,095 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:55,159 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:55,159 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:55,170 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:55,194 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:55,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:25:55,201 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1057 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1057) |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:55,243 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1057 (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$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1060))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1057)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:25:55,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750247520] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:55,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:25:55,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-03-04 09:25:55,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446448588] [2025-03-04 09:25:55,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:25:55,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 09:25:55,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:55,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 09:25:55,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=425, Unknown=9, NotChecked=86, Total=600 [2025-03-04 09:25:55,245 INFO L87 Difference]: Start difference. First operand 1363 states and 1723 transitions. Second operand has 22 states, 19 states have (on average 7.894736842105263) internal successors, (150), 21 states have internal predecessors, (150), 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:25:57,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:57,095 INFO L93 Difference]: Finished difference Result 1365 states and 1727 transitions. [2025-03-04 09:25:57,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:25:57,095 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.894736842105263) internal successors, (150), 21 states have internal predecessors, (150), 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 95 [2025-03-04 09:25:57,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:57,097 INFO L225 Difference]: With dead ends: 1365 [2025-03-04 09:25:57,097 INFO L226 Difference]: Without dead ends: 1365 [2025-03-04 09:25:57,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=547, Unknown=9, NotChecked=98, Total=756 [2025-03-04 09:25:57,097 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 692 mSDsluCounter, 5970 mSDsCounter, 0 mSdLazyCounter, 4627 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 6441 SdHoareTripleChecker+Invalid, 4642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:57,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 6441 Invalid, 4642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4627 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 09:25:57,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2025-03-04 09:25:57,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1362. [2025-03-04 09:25:57,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1119 states have (on average 1.5272564789991063) internal successors, (1709), 1352 states have internal predecessors, (1709), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:25:57,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1721 transitions. [2025-03-04 09:25:57,112 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1721 transitions. Word has length 95 [2025-03-04 09:25:57,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:57,113 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 1721 transitions. [2025-03-04 09:25:57,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.894736842105263) internal successors, (150), 21 states have internal predecessors, (150), 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:25:57,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1721 transitions. [2025-03-04 09:25:57,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 09:25:57,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:57,114 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:25:57,121 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:57,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:25:57,315 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr309REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:57,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:57,315 INFO L85 PathProgramCache]: Analyzing trace with hash -990072659, now seen corresponding path program 1 times [2025-03-04 09:25:57,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:57,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044248531] [2025-03-04 09:25:57,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:57,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:57,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 09:25:57,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 09:25:57,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:57,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:57,854 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:57,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:25:57,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044248531] [2025-03-04 09:25:57,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044248531] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:57,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155815413] [2025-03-04 09:25:57,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:57,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:25:57,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:25:57,857 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:57,859 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:58,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 09:25:58,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 09:25:58,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:58,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:25:58,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 09:25:58,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:25:58,129 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,234 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:25:58,235 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,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 09:25:58,254 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:58,262 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,321 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,326 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,412 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:58,412 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,419 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,469 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:25:58,469 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,476 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,488 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:58,493 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,497 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,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:25:58,544 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1211 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1212 (Array Int Int)) (v_ArrVal_1211 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1212) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-03-04 09:25:58,550 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1212 (Array Int Int)) (v_ArrVal_1211 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1212) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1211 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2025-03-04 09:25:58,595 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1211 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1217) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1212 (Array Int Int)) (v_ArrVal_1211 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1218))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1217) .cse1 v_ArrVal_1211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1212) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-03-04 09:25:58,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155815413] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:25:58,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:25:58,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2025-03-04 09:25:58,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219463555] [2025-03-04 09:25:58,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:25:58,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 09:25:58,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:25:58,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 09:25:58,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=286, Unknown=3, NotChecked=108, Total=462 [2025-03-04 09:25:58,597 INFO L87 Difference]: Start difference. First operand 1362 states and 1721 transitions. Second operand has 17 states, 14 states have (on average 10.214285714285714) internal successors, (143), 17 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:25:59,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:25:59,730 INFO L93 Difference]: Finished difference Result 1364 states and 1725 transitions. [2025-03-04 09:25:59,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 09:25:59,731 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 10.214285714285714) internal successors, (143), 17 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2025-03-04 09:25:59,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:25:59,732 INFO L225 Difference]: With dead ends: 1364 [2025-03-04 09:25:59,732 INFO L226 Difference]: Without dead ends: 1364 [2025-03-04 09:25:59,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=459, Unknown=3, NotChecked=138, Total=702 [2025-03-04 09:25:59,733 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 695 mSDsluCounter, 2748 mSDsCounter, 0 mSdLazyCounter, 3060 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 3222 SdHoareTripleChecker+Invalid, 3076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:25:59,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 3222 Invalid, 3076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3060 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 09:25:59,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2025-03-04 09:25:59,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1346. [2025-03-04 09:25:59,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1105 states have (on average 1.5312217194570135) internal successors, (1692), 1338 states have internal predecessors, (1692), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:25:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1702 transitions. [2025-03-04 09:25:59,742 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1702 transitions. Word has length 95 [2025-03-04 09:25:59,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:25:59,742 INFO L471 AbstractCegarLoop]: Abstraction has 1346 states and 1702 transitions. [2025-03-04 09:25:59,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 10.214285714285714) internal successors, (143), 17 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:25:59,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1702 transitions. [2025-03-04 09:25:59,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 09:25:59,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:25:59,743 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:59,753 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:59,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 09:25:59,944 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:25:59,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:25:59,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1969891226, now seen corresponding path program 1 times [2025-03-04 09:25:59,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:25:59,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527507981] [2025-03-04 09:25:59,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:25:59,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:25:59,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 09:25:59,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 09:25:59,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:25:59,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:00,227 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:00,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:26:00,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527507981] [2025-03-04 09:26:00,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527507981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:26:00,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:26:00,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 09:26:00,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615087055] [2025-03-04 09:26:00,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:26:00,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 09:26:00,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:26:00,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 09:26:00,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 09:26:00,228 INFO L87 Difference]: Start difference. First operand 1346 states and 1702 transitions. Second operand has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 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:01,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:26:01,393 INFO L93 Difference]: Finished difference Result 1371 states and 1733 transitions. [2025-03-04 09:26:01,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 09:26:01,394 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 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 97 [2025-03-04 09:26:01,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:26:01,396 INFO L225 Difference]: With dead ends: 1371 [2025-03-04 09:26:01,396 INFO L226 Difference]: Without dead ends: 1371 [2025-03-04 09:26:01,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-03-04 09:26:01,396 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 714 mSDsluCounter, 4124 mSDsCounter, 0 mSdLazyCounter, 3283 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 4598 SdHoareTripleChecker+Invalid, 3295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:26:01,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 4598 Invalid, 3295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3283 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 09:26:01,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2025-03-04 09:26:01,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1367. [2025-03-04 09:26:01,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 1125 states have (on average 1.5244444444444445) internal successors, (1715), 1357 states have internal predecessors, (1715), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:26:01,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1727 transitions. [2025-03-04 09:26:01,405 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1727 transitions. Word has length 97 [2025-03-04 09:26:01,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:26:01,406 INFO L471 AbstractCegarLoop]: Abstraction has 1367 states and 1727 transitions. [2025-03-04 09:26:01,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 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:01,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1727 transitions. [2025-03-04 09:26:01,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 09:26:01,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:26:01,406 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:26:01,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 09:26:01,407 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr305REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:26:01,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:26:01,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1969891225, now seen corresponding path program 1 times [2025-03-04 09:26:01,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:26:01,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667413984] [2025-03-04 09:26:01,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:01,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:26:01,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 09:26:01,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 09:26:01,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:01,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:01,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:26:01,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:26:01,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667413984] [2025-03-04 09:26:01,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667413984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:26:01,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:26:01,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 09:26:01,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249126663] [2025-03-04 09:26:01,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:26:01,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 09:26:01,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:26:01,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 09:26:01,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 09:26:01,836 INFO L87 Difference]: Start difference. First operand 1367 states and 1727 transitions. Second operand has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 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,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:26:03,139 INFO L93 Difference]: Finished difference Result 1370 states and 1731 transitions. [2025-03-04 09:26:03,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:26:03,140 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 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 97 [2025-03-04 09:26:03,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:26:03,142 INFO L225 Difference]: With dead ends: 1370 [2025-03-04 09:26:03,142 INFO L226 Difference]: Without dead ends: 1370 [2025-03-04 09:26:03,142 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:26:03,142 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 709 mSDsluCounter, 3097 mSDsCounter, 0 mSdLazyCounter, 3526 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 3572 SdHoareTripleChecker+Invalid, 3537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:26:03,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 3572 Invalid, 3537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3526 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 09:26:03,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2025-03-04 09:26:03,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1367. [2025-03-04 09:26:03,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 1125 states have (on average 1.5226666666666666) internal successors, (1713), 1357 states have internal predecessors, (1713), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:26:03,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1725 transitions. [2025-03-04 09:26:03,154 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1725 transitions. Word has length 97 [2025-03-04 09:26:03,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:26:03,155 INFO L471 AbstractCegarLoop]: Abstraction has 1367 states and 1725 transitions. [2025-03-04 09:26:03,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 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,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1725 transitions. [2025-03-04 09:26:03,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 09:26:03,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:26:03,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:26:03,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 09:26:03,156 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:26:03,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:26:03,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1713337554, now seen corresponding path program 1 times [2025-03-04 09:26:03,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:26:03,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145137959] [2025-03-04 09:26:03,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:03,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:26:03,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 09:26:03,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 09:26:03,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:03,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:03,535 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:03,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:26:03,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145137959] [2025-03-04 09:26:03,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145137959] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:26:03,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18254059] [2025-03-04 09:26:03,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:03,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:26:03,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:26:03,538 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:26:03,541 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:26:03,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 09:26:03,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 09:26:03,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:03,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:03,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 09:26:03,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:26:03,707 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:03,787 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:26:03,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 09:26:03,810 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:03,882 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:03,976 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:03,977 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:04,047 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:04,048 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:04,113 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:04,113 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:04,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:26:04,143 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:04,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:26:04,193 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1523 (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$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1523))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1524)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:26:08,349 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1527 (Array Int Int)) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1523 (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$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1527))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1523)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1524)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:26:08,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18254059] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:26:08,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:26:08,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2025-03-04 09:26:08,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756090844] [2025-03-04 09:26:08,351 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:26:08,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 09:26:08,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:26:08,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 09:26:08,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=577, Unknown=26, NotChecked=102, Total=812 [2025-03-04 09:26:08,352 INFO L87 Difference]: Start difference. First operand 1367 states and 1725 transitions. Second operand has 24 states, 21 states have (on average 7.428571428571429) internal successors, (156), 23 states have internal predecessors, (156), 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:10,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:26:10,170 INFO L93 Difference]: Finished difference Result 1369 states and 1729 transitions. [2025-03-04 09:26:10,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 09:26:10,171 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.428571428571429) internal successors, (156), 23 states have internal predecessors, (156), 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 98 [2025-03-04 09:26:10,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:26:10,173 INFO L225 Difference]: With dead ends: 1369 [2025-03-04 09:26:10,173 INFO L226 Difference]: Without dead ends: 1369 [2025-03-04 09:26:10,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=130, Invalid=720, Unknown=28, NotChecked=114, Total=992 [2025-03-04 09:26:10,174 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 689 mSDsluCounter, 5020 mSDsCounter, 0 mSdLazyCounter, 3978 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 5490 SdHoareTripleChecker+Invalid, 3990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 09:26:10,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 5490 Invalid, 3990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3978 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 09:26:10,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2025-03-04 09:26:10,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1366. [2025-03-04 09:26:10,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1125 states have (on average 1.520888888888889) internal successors, (1711), 1356 states have internal predecessors, (1711), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:26:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1723 transitions. [2025-03-04 09:26:10,183 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1723 transitions. Word has length 98 [2025-03-04 09:26:10,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:26:10,183 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 1723 transitions. [2025-03-04 09:26:10,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.428571428571429) internal successors, (156), 23 states have internal predecessors, (156), 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:10,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1723 transitions. [2025-03-04 09:26:10,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 09:26:10,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:26:10,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:26:10,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 09:26:10,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:26:10,385 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr305REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:26:10,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:26:10,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1713337553, now seen corresponding path program 1 times [2025-03-04 09:26:10,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:26:10,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300870625] [2025-03-04 09:26:10,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:10,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:26:10,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 09:26:10,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 09:26:10,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:10,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:11,052 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:11,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:26:11,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300870625] [2025-03-04 09:26:11,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300870625] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:26:11,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328248900] [2025-03-04 09:26:11,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:11,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:26:11,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:26:11,055 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:26:11,056 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:26:11,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 09:26:11,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 09:26:11,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:11,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:11,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 09:26:11,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:26:11,253 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:11,332 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:11,337 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:26:11,338 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:11,361 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:11,364 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:11,460 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:11,462 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:11,544 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:11,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:26:11,552 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:11,615 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:11,615 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:11,622 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:11,664 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:11,664 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:11,671 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:11,680 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:11,682 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:11,697 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:11,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:26:11,741 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1693 (Array Int Int)) (v_ArrVal_1692 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1692 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))))) is different from false [2025-03-04 09:26:11,752 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1693 (Array Int Int)) (v_ArrVal_1692 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1692 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) is different from false [2025-03-04 09:26:11,768 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1693 (Array Int Int)) (v_ArrVal_1692 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1691))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1690) .cse0 v_ArrVal_1692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1692 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1690) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2025-03-04 09:26:11,779 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1693 (Array Int Int)) (v_ArrVal_1692 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1691))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1690) .cse1 v_ArrVal_1692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1692 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1690) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))) is different from false [2025-03-04 09:26:11,826 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1699 (Array Int Int)) (v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1693 (Array Int Int)) (v_ArrVal_1692 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1698))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1691))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1699) .cse0 v_ArrVal_1690) .cse1 v_ArrVal_1692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1699 (Array Int Int)) (v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1692 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1698))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1699) .cse5 v_ArrVal_1690) (select (select (store .cse6 .cse5 v_ArrVal_1691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1692))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))))) is different from false [2025-03-04 09:26:11,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328248900] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:26:11,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:26:11,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2025-03-04 09:26:11,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355497368] [2025-03-04 09:26:11,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:26:11,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 09:26:11,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:26:11,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 09:26:11,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=480, Unknown=5, NotChecked=240, Total=812 [2025-03-04 09:26:11,829 INFO L87 Difference]: Start difference. First operand 1366 states and 1723 transitions. Second operand has 22 states, 19 states have (on average 8.210526315789474) internal successors, (156), 22 states have internal predecessors, (156), 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:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:26:14,784 INFO L93 Difference]: Finished difference Result 1368 states and 1727 transitions. [2025-03-04 09:26:14,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:26:14,784 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.210526315789474) internal successors, (156), 22 states have internal predecessors, (156), 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 98 [2025-03-04 09:26:14,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:26:14,786 INFO L225 Difference]: With dead ends: 1368 [2025-03-04 09:26:14,786 INFO L226 Difference]: Without dead ends: 1368 [2025-03-04 09:26:14,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=745, Unknown=5, NotChecked=300, Total=1190 [2025-03-04 09:26:14,787 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 697 mSDsluCounter, 4865 mSDsCounter, 0 mSdLazyCounter, 5694 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 5338 SdHoareTripleChecker+Invalid, 5710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 5694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:26:14,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 5338 Invalid, 5710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 5694 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-04 09:26:14,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2025-03-04 09:26:14,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1344. [2025-03-04 09:26:14,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1105 states have (on average 1.527601809954751) internal successors, (1688), 1336 states have internal predecessors, (1688), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:26:14,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1698 transitions. [2025-03-04 09:26:14,797 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1698 transitions. Word has length 98 [2025-03-04 09:26:14,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:26:14,797 INFO L471 AbstractCegarLoop]: Abstraction has 1344 states and 1698 transitions. [2025-03-04 09:26:14,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.210526315789474) internal successors, (156), 22 states have internal predecessors, (156), 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:14,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1698 transitions. [2025-03-04 09:26:14,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 09:26:14,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:26:14,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:26:14,805 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:26:14,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:26:14,998 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr301REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:26:14,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:26:14,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1404466702, now seen corresponding path program 1 times [2025-03-04 09:26:14,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:26:14,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441041723] [2025-03-04 09:26:14,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:14,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:26:15,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 09:26:15,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 09:26:15,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:15,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:15,631 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:15,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:26:15,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441041723] [2025-03-04 09:26:15,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441041723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:26:15,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:26:15,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 09:26:15,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189592229] [2025-03-04 09:26:15,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:26:15,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:26:15,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:26:15,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:26:15,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:26:15,632 INFO L87 Difference]: Start difference. First operand 1344 states and 1698 transitions. Second operand has 13 states, 12 states have (on average 8.166666666666666) internal successors, (98), 13 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:17,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:26:17,359 INFO L93 Difference]: Finished difference Result 1375 states and 1735 transitions. [2025-03-04 09:26:17,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 09:26:17,360 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.166666666666666) internal successors, (98), 13 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:17,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:26:17,362 INFO L225 Difference]: With dead ends: 1375 [2025-03-04 09:26:17,362 INFO L226 Difference]: Without dead ends: 1375 [2025-03-04 09:26:17,362 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:26:17,362 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 712 mSDsluCounter, 3100 mSDsCounter, 0 mSdLazyCounter, 3527 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 3538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:26:17,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 3574 Invalid, 3538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3527 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 09:26:17,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2025-03-04 09:26:17,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1371. [2025-03-04 09:26:17,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 1131 states have (on average 1.5181255526083113) internal successors, (1717), 1361 states have internal predecessors, (1717), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:26:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1729 transitions. [2025-03-04 09:26:17,372 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1729 transitions. Word has length 100 [2025-03-04 09:26:17,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:26:17,372 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 1729 transitions. [2025-03-04 09:26:17,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.166666666666666) internal successors, (98), 13 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:17,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1729 transitions. [2025-03-04 09:26:17,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 09:26:17,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:26:17,373 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:17,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 09:26:17,373 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr300REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:26:17,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:26:17,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1404466701, now seen corresponding path program 1 times [2025-03-04 09:26:17,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:26:17,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995574841] [2025-03-04 09:26:17,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:17,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:26:17,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 09:26:17,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 09:26:17,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:17,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:17,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:26:17,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:26:17,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995574841] [2025-03-04 09:26:17,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995574841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:26:17,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:26:17,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 09:26:17,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473367291] [2025-03-04 09:26:17,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:26:17,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 09:26:17,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:26:17,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 09:26:17,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-04 09:26:17,804 INFO L87 Difference]: Start difference. First operand 1371 states and 1729 transitions. Second operand has 16 states, 14 states have (on average 7.0) internal successors, (98), 15 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:19,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:26:19,227 INFO L93 Difference]: Finished difference Result 1374 states and 1733 transitions. [2025-03-04 09:26:19,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 09:26:19,227 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.0) internal successors, (98), 15 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:19,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:26:19,230 INFO L225 Difference]: With dead ends: 1374 [2025-03-04 09:26:19,230 INFO L226 Difference]: Without dead ends: 1374 [2025-03-04 09:26:19,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-03-04 09:26:19,231 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 727 mSDsluCounter, 3678 mSDsCounter, 0 mSdLazyCounter, 2992 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 4149 SdHoareTripleChecker+Invalid, 3004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:26:19,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 4149 Invalid, 3004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2992 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 09:26:19,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2025-03-04 09:26:19,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1371. [2025-03-04 09:26:19,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 1131 states have (on average 1.5163572060123784) internal successors, (1715), 1361 states have internal predecessors, (1715), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:26:19,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1727 transitions. [2025-03-04 09:26:19,244 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1727 transitions. Word has length 100 [2025-03-04 09:26:19,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:26:19,245 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 1727 transitions. [2025-03-04 09:26:19,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.0) internal successors, (98), 15 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:19,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1727 transitions. [2025-03-04 09:26:19,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 09:26:19,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:26:19,247 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:19,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 09:26:19,247 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr301REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:26:19,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:26:19,248 INFO L85 PathProgramCache]: Analyzing trace with hash -646877626, now seen corresponding path program 1 times [2025-03-04 09:26:19,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:26:19,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84787622] [2025-03-04 09:26:19,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:19,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:26:19,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 09:26:19,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 09:26:19,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:19,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:19,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:26:19,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:26:19,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84787622] [2025-03-04 09:26:19,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84787622] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:26:19,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274902838] [2025-03-04 09:26:19,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:19,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:26:19,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:26:19,869 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:26:19,871 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:26:20,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 09:26:20,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 09:26:20,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:20,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:20,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-04 09:26:20,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:26:20,077 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:20,171 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:26:20,172 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:20,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 09:26:20,205 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:20,208 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:20,279 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:20,283 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:20,382 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:20,383 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:20,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:20,458 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:20,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:26:20,463 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:20,506 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:20,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-04 09:26:20,512 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:20,558 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:20,558 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:20,564 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:20,579 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:20,585 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:20,608 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:20,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:26:20,668 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2035) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2034) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2035 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2035) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2025-03-04 09:26:20,679 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2035 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2035) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2035) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2034) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-03-04 09:26:20,698 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2032) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2033) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2035) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2033))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2032) .cse1 v_ArrVal_2035) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2034) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-03-04 09:26:20,818 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2030))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2033))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2031) .cse0 v_ArrVal_2032) .cse1 v_ArrVal_2035) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2034) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2030))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2031) .cse5 v_ArrVal_2032) (select (select (store .cse6 .cse5 v_ArrVal_2033) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2035))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2025-03-04 09:26:20,834 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2030))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2033))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2031) .cse1 v_ArrVal_2032) .cse2 v_ArrVal_2035) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2034) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2030))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2031) .cse6 v_ArrVal_2032) (select (select (store .cse7 .cse6 v_ArrVal_2033) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2035))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2025-03-04 09:26:20,891 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (v_ArrVal_2041 (Array Int Int)) (v_ArrVal_2030 (Array Int Int)) (v_ArrVal_2040 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2041))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2030))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2040) .cse0 v_ArrVal_2031) .cse1 v_ArrVal_2032) (select (select (store .cse2 .cse1 v_ArrVal_2033) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2035))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (v_ArrVal_2041 (Array Int Int)) (v_ArrVal_2030 (Array Int Int)) (v_ArrVal_2040 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2041))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2030))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2033))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2040) .cse5 v_ArrVal_2031) .cse6 v_ArrVal_2032) .cse7 v_ArrVal_2035) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2034) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2025-03-04 09:26:20,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274902838] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:26:20,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:26:20,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2025-03-04 09:26:20,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211915421] [2025-03-04 09:26:20,895 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:26:20,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 09:26:20,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:26:20,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 09:26:20,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=600, Unknown=16, NotChecked=330, Total=1056 [2025-03-04 09:26:20,896 INFO L87 Difference]: Start difference. First operand 1371 states and 1727 transitions. Second operand has 24 states, 21 states have (on average 7.714285714285714) internal successors, (162), 24 states have internal predecessors, (162), 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:24,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:26:24,043 INFO L93 Difference]: Finished difference Result 1373 states and 1731 transitions. [2025-03-04 09:26:24,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 09:26:24,044 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.714285714285714) internal successors, (162), 24 states have internal predecessors, (162), 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 101 [2025-03-04 09:26:24,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:26:24,046 INFO L225 Difference]: With dead ends: 1373 [2025-03-04 09:26:24,046 INFO L226 Difference]: Without dead ends: 1373 [2025-03-04 09:26:24,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=951, Unknown=16, NotChecked=414, Total=1560 [2025-03-04 09:26:24,047 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 695 mSDsluCounter, 5303 mSDsCounter, 0 mSdLazyCounter, 5996 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 5775 SdHoareTripleChecker+Invalid, 6012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 5996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:26:24,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 5775 Invalid, 6012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 5996 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-04 09:26:24,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2025-03-04 09:26:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1370. [2025-03-04 09:26:24,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1131 states have (on average 1.5145888594164456) internal successors, (1713), 1360 states have internal predecessors, (1713), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:26:24,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1725 transitions. [2025-03-04 09:26:24,063 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1725 transitions. Word has length 101 [2025-03-04 09:26:24,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:26:24,064 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 1725 transitions. [2025-03-04 09:26:24,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.714285714285714) internal successors, (162), 24 states have internal predecessors, (162), 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:24,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1725 transitions. [2025-03-04 09:26:24,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 09:26:24,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:26:24,065 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:24,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 09:26:24,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:26:24,266 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr300REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:26:24,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:26:24,267 INFO L85 PathProgramCache]: Analyzing trace with hash -646877627, now seen corresponding path program 1 times [2025-03-04 09:26:24,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:26:24,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820184174] [2025-03-04 09:26:24,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:24,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:26:24,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 09:26:24,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 09:26:24,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:24,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:24,774 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:24,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:26:24,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820184174] [2025-03-04 09:26:24,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820184174] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:26:24,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574271840] [2025-03-04 09:26:24,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:24,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:26:24,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:26:24,776 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:26:24,784 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:26:24,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 09:26:24,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 09:26:24,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:24,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:24,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 09:26:24,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:26:24,975 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:25,077 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:26:25,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 09:26:25,100 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:25,176 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:25,297 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:25,297 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:25,357 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:25,358 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:25,398 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:25,399 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:25,444 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:25,444 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:25,456 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:25,482 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:25,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:26:25,659 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2215 (Array Int Int)) (v_ArrVal_2214 (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$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2214))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2215)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2216)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:26:25,736 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2215 (Array Int Int)) (v_ArrVal_2214 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2219))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2214)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2215)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2216)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:26:25,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574271840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:26:25,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:26:25,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2025-03-04 09:26:25,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406239399] [2025-03-04 09:26:25,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:26:25,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 09:26:25,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:26:25,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 09:26:25,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=751, Unknown=49, NotChecked=118, Total=1056 [2025-03-04 09:26:25,739 INFO L87 Difference]: Start difference. First operand 1370 states and 1725 transitions. Second operand has 26 states, 23 states have (on average 7.043478260869565) internal successors, (162), 25 states have internal predecessors, (162), 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:27,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:26:27,941 INFO L93 Difference]: Finished difference Result 1372 states and 1729 transitions. [2025-03-04 09:26:27,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 09:26:27,941 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.043478260869565) internal successors, (162), 25 states have internal predecessors, (162), 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 101 [2025-03-04 09:26:27,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:26:27,943 INFO L225 Difference]: With dead ends: 1372 [2025-03-04 09:26:27,943 INFO L226 Difference]: Without dead ends: 1372 [2025-03-04 09:26:27,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=917, Unknown=51, NotChecked=130, Total=1260 [2025-03-04 09:26:27,944 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 681 mSDsluCounter, 5467 mSDsCounter, 0 mSdLazyCounter, 4289 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 5936 SdHoareTripleChecker+Invalid, 4304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:26:27,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 5936 Invalid, 4304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4289 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 09:26:27,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2025-03-04 09:26:27,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1342. [2025-03-04 09:26:27,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 1105 states have (on average 1.5239819004524886) internal successors, (1684), 1334 states have internal predecessors, (1684), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:26:27,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1694 transitions. [2025-03-04 09:26:27,953 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1694 transitions. Word has length 101 [2025-03-04 09:26:27,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:26:27,953 INFO L471 AbstractCegarLoop]: Abstraction has 1342 states and 1694 transitions. [2025-03-04 09:26:27,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.043478260869565) internal successors, (162), 25 states have internal predecessors, (162), 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:27,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1694 transitions. [2025-03-04 09:26:27,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 09:26:27,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:26:27,954 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, 1] [2025-03-04 09:26:27,963 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:28,154 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,SelfDestructingSolverStorable34 [2025-03-04 09:26:28,154 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr296REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:26:28,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:26:28,155 INFO L85 PathProgramCache]: Analyzing trace with hash 164657031, now seen corresponding path program 1 times [2025-03-04 09:26:28,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:26:28,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859468980] [2025-03-04 09:26:28,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:28,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:26:28,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 09:26:28,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 09:26:28,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:28,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:28,695 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:28,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:26:28,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859468980] [2025-03-04 09:26:28,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859468980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:26:28,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:26:28,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 09:26:28,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58585059] [2025-03-04 09:26:28,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:26:28,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 09:26:28,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:26:28,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 09:26:28,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-03-04 09:26:28,696 INFO L87 Difference]: Start difference. First operand 1342 states and 1694 transitions. Second operand has 17 states, 15 states have (on average 6.8) internal successors, (102), 16 states have internal predecessors, (102), 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:30,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:26:30,197 INFO L93 Difference]: Finished difference Result 1381 states and 1739 transitions. [2025-03-04 09:26:30,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 09:26:30,197 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.8) internal successors, (102), 16 states have internal predecessors, (102), 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 104 [2025-03-04 09:26:30,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:26:30,199 INFO L225 Difference]: With dead ends: 1381 [2025-03-04 09:26:30,199 INFO L226 Difference]: Without dead ends: 1381 [2025-03-04 09:26:30,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2025-03-04 09:26:30,199 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 714 mSDsluCounter, 4102 mSDsCounter, 0 mSdLazyCounter, 3320 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 4571 SdHoareTripleChecker+Invalid, 3335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:26:30,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 4571 Invalid, 3335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3320 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 09:26:30,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-03-04 09:26:30,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1377. [2025-03-04 09:26:30,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1139 states have (on average 1.5109745390693592) internal successors, (1721), 1367 states have internal predecessors, (1721), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:26:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1733 transitions. [2025-03-04 09:26:30,210 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1733 transitions. Word has length 104 [2025-03-04 09:26:30,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:26:30,210 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 1733 transitions. [2025-03-04 09:26:30,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.8) internal successors, (102), 16 states have internal predecessors, (102), 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:30,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1733 transitions. [2025-03-04 09:26:30,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 09:26:30,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:26:30,211 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, 1] [2025-03-04 09:26:30,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 09:26:30,211 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr297REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:26:30,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:26:30,211 INFO L85 PathProgramCache]: Analyzing trace with hash 164657032, now seen corresponding path program 1 times [2025-03-04 09:26:30,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:26:30,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764801975] [2025-03-04 09:26:30,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:30,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:26:30,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 09:26:30,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 09:26:30,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:30,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:30,981 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:30,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:26:30,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764801975] [2025-03-04 09:26:30,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764801975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:26:30,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:26:30,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 09:26:30,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399017404] [2025-03-04 09:26:30,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:26:30,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 09:26:30,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:26:30,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 09:26:30,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-03-04 09:26:30,982 INFO L87 Difference]: Start difference. First operand 1377 states and 1733 transitions. Second operand has 18 states, 16 states have (on average 6.375) internal successors, (102), 17 states have internal predecessors, (102), 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:33,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:26:33,022 INFO L93 Difference]: Finished difference Result 1380 states and 1737 transitions. [2025-03-04 09:26:33,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 09:26:33,022 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.375) internal successors, (102), 17 states have internal predecessors, (102), 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 104 [2025-03-04 09:26:33,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:26:33,024 INFO L225 Difference]: With dead ends: 1380 [2025-03-04 09:26:33,024 INFO L226 Difference]: Without dead ends: 1380 [2025-03-04 09:26:33,024 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:33,025 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 711 mSDsluCounter, 3441 mSDsCounter, 0 mSdLazyCounter, 4012 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 3911 SdHoareTripleChecker+Invalid, 4027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:26:33,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 3911 Invalid, 4027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4012 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 09:26:33,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2025-03-04 09:26:33,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1377. [2025-03-04 09:26:33,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1139 states have (on average 1.5092186128182616) internal successors, (1719), 1367 states have internal predecessors, (1719), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:26:33,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1731 transitions. [2025-03-04 09:26:33,034 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1731 transitions. Word has length 104 [2025-03-04 09:26:33,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:26:33,034 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 1731 transitions. [2025-03-04 09:26:33,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.375) internal successors, (102), 17 states have internal predecessors, (102), 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:33,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1731 transitions. [2025-03-04 09:26:33,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 09:26:33,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:26:33,034 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, 1, 1] [2025-03-04 09:26:33,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 09:26:33,035 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr296REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:26:33,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:26:33,035 INFO L85 PathProgramCache]: Analyzing trace with hash -865823809, now seen corresponding path program 1 times [2025-03-04 09:26:33,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:26:33,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416874992] [2025-03-04 09:26:33,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:33,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:26:33,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 09:26:33,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 09:26:33,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:33,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:33,663 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:33,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:26:33,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416874992] [2025-03-04 09:26:33,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416874992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:26:33,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932124739] [2025-03-04 09:26:33,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:33,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:26:33,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:26:33,667 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:33,668 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:33,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 09:26:33,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 09:26:33,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:33,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:33,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 09:26:33,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:26:33,875 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:33,975 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:26:33,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 09:26:34,008 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:34,069 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:34,171 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:34,172 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:34,238 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:34,239 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:34,286 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:34,286 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:34,330 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:34,330 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:34,375 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:34,375 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:34,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:34,439 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-04 09:26:34,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-03-04 09:26:34,448 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:34,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:26:35,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932124739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:26:35,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:26:35,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2025-03-04 09:26:35,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190196570] [2025-03-04 09:26:35,086 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:26:35,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 09:26:35,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:26:35,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 09:26:35,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1162, Unknown=55, NotChecked=0, Total=1406 [2025-03-04 09:26:35,087 INFO L87 Difference]: Start difference. First operand 1377 states and 1731 transitions. Second operand has 27 states, 24 states have (on average 7.083333333333333) internal successors, (170), 26 states have internal predecessors, (170), 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:37,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:26:37,561 INFO L93 Difference]: Finished difference Result 1379 states and 1735 transitions. [2025-03-04 09:26:37,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 09:26:37,561 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 7.083333333333333) internal successors, (170), 26 states have internal predecessors, (170), 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 105 [2025-03-04 09:26:37,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:26:37,564 INFO L225 Difference]: With dead ends: 1379 [2025-03-04 09:26:37,564 INFO L226 Difference]: Without dead ends: 1379 [2025-03-04 09:26:37,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=215, Invalid=1370, Unknown=55, NotChecked=0, Total=1640 [2025-03-04 09:26:37,565 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 677 mSDsluCounter, 5914 mSDsCounter, 0 mSdLazyCounter, 4666 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 6382 SdHoareTripleChecker+Invalid, 4681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:26:37,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 6382 Invalid, 4681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4666 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-04 09:26:37,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2025-03-04 09:26:37,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1376. [2025-03-04 09:26:37,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1139 states have (on average 1.507462686567164) internal successors, (1717), 1366 states have internal predecessors, (1717), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:26:37,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1729 transitions. [2025-03-04 09:26:37,579 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1729 transitions. Word has length 105 [2025-03-04 09:26:37,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:26:37,579 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 1729 transitions. [2025-03-04 09:26:37,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 7.083333333333333) internal successors, (170), 26 states have internal predecessors, (170), 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:37,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1729 transitions. [2025-03-04 09:26:37,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 09:26:37,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:26:37,581 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, 1, 1] [2025-03-04 09:26:37,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 09:26:37,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-04 09:26:37,782 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr297REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:26:37,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:26:37,782 INFO L85 PathProgramCache]: Analyzing trace with hash -865823808, now seen corresponding path program 1 times [2025-03-04 09:26:37,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:26:37,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967369042] [2025-03-04 09:26:37,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:37,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:26:37,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 09:26:37,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 09:26:37,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:37,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:38,608 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:38,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:26:38,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967369042] [2025-03-04 09:26:38,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967369042] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:26:38,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787386535] [2025-03-04 09:26:38,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:38,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:26:38,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:26:38,610 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:38,611 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:38,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 09:26:38,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 09:26:38,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:38,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:38,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-04 09:26:38,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:26:38,822 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:38,900 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:38,914 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:26:38,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 09:26:38,957 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:38,961 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:39,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-03-04 09:26:39,067 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:39,201 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:39,201 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:39,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-04 09:26:39,302 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:39,302 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:39,311 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:39,397 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:39,397 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:39,405 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:39,493 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:39,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:39,498 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:39,569 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 09:26:39,569 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:39,573 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:39,592 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:39,596 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:39,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:26:39,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 09:26:39,646 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-04 09:26:39,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-04 09:26:39,671 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:39,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:26:40,329 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0))) (forall ((v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2784 (Array Int Int)) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2781 (Array Int Int))) (< 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2782))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2781) .cse0 v_ArrVal_2784) (select (select (store .cse1 .cse0 v_ArrVal_2783) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2786))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)))) (forall ((v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2785 (Array Int Int)) (v_ArrVal_2784 (Array Int Int)) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2781 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2787 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2782))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2783))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2781) .cse3 v_ArrVal_2784) .cse4 v_ArrVal_2786) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2787) (select (select (store .cse5 .cse4 v_ArrVal_2785) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))))) is different from false [2025-03-04 09:26:40,352 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2785 (Array Int Int)) (v_ArrVal_2784 (Array Int Int)) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2781 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2787 Int)) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2782))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2783))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2781) .cse1 v_ArrVal_2784) .cse2 v_ArrVal_2786) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2787) (select (select (store .cse4 .cse2 v_ArrVal_2785) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (or (forall ((v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2784 (Array Int Int)) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2781 (Array Int Int))) (< 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2782))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2781) .cse6 v_ArrVal_2784) (select (select (store .cse7 .cse6 v_ArrVal_2783) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2786))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0))))))) is different from false [2025-03-04 09:26:41,629 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_2779 (Array Int Int)) (v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2785 (Array Int Int)) (v_ArrVal_2784 (Array Int Int)) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2781 (Array Int Int)) (v_ArrVal_2780 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2787 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2779))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2782))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_2783))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2780) .cse1 v_ArrVal_2781) .cse2 v_ArrVal_2784) .cse3 v_ArrVal_2786) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2787) (select (select (store .cse5 .cse3 v_ArrVal_2785) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) (or (forall ((v_ArrVal_2779 (Array Int Int)) (v_ArrVal_2786 (Array Int Int)) (v_ArrVal_2784 (Array Int Int)) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2781 (Array Int Int)) (v_ArrVal_2780 (Array Int Int))) (< 0 (+ (select (select (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2779))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_2782))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2780) .cse8 v_ArrVal_2781) .cse9 v_ArrVal_2784) (select (select (store .cse10 .cse9 v_ArrVal_2783) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2786))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0))))))) is different from false [2025-03-04 09:26:42,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787386535] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:26:42,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:26:42,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2025-03-04 09:26:42,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442021037] [2025-03-04 09:26:42,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:26:42,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 09:26:42,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:26:42,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 09:26:42,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1300, Unknown=33, NotChecked=228, Total=1722 [2025-03-04 09:26:42,022 INFO L87 Difference]: Start difference. First operand 1376 states and 1729 transitions. Second operand has 30 states, 27 states have (on average 6.296296296296297) internal successors, (170), 29 states have internal predecessors, (170), 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:45,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:26:45,869 INFO L93 Difference]: Finished difference Result 1378 states and 1733 transitions. [2025-03-04 09:26:45,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 09:26:45,869 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 6.296296296296297) internal successors, (170), 29 states have internal predecessors, (170), 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 105 [2025-03-04 09:26:45,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:26:45,872 INFO L225 Difference]: With dead ends: 1378 [2025-03-04 09:26:45,872 INFO L226 Difference]: Without dead ends: 1378 [2025-03-04 09:26:45,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=274, Invalid=2057, Unknown=33, NotChecked=288, Total=2652 [2025-03-04 09:26:45,873 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 682 mSDsluCounter, 5641 mSDsCounter, 0 mSdLazyCounter, 6494 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 6109 SdHoareTripleChecker+Invalid, 6515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 6494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:26:45,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 6109 Invalid, 6515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 6494 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-04 09:26:45,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2025-03-04 09:26:45,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1340. [2025-03-04 09:26:45,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1105 states have (on average 1.5203619909502262) internal successors, (1680), 1332 states have internal predecessors, (1680), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:26:45,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1690 transitions. [2025-03-04 09:26:45,883 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1690 transitions. Word has length 105 [2025-03-04 09:26:45,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:26:45,883 INFO L471 AbstractCegarLoop]: Abstraction has 1340 states and 1690 transitions. [2025-03-04 09:26:45,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 6.296296296296297) internal successors, (170), 29 states have internal predecessors, (170), 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:45,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1690 transitions. [2025-03-04 09:26:45,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 09:26:45,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:26:45,884 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, 1, 1, 1, 1] [2025-03-04 09:26:45,892 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:46,084 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,SelfDestructingSolverStorable38 [2025-03-04 09:26:46,085 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr292REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:26:46,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:26:46,085 INFO L85 PathProgramCache]: Analyzing trace with hash 445791517, now seen corresponding path program 1 times [2025-03-04 09:26:46,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:26:46,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922957743] [2025-03-04 09:26:46,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:46,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:26:46,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 09:26:46,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 09:26:46,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:46,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:46,542 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:46,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:26:46,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922957743] [2025-03-04 09:26:46,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922957743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:26:46,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:26:46,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 09:26:46,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699733343] [2025-03-04 09:26:46,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:26:46,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 09:26:46,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:26:46,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 09:26:46,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-04 09:26:46,543 INFO L87 Difference]: Start difference. First operand 1340 states and 1690 transitions. Second operand has 15 states, 14 states have (on average 7.5) internal successors, (105), 15 states have internal predecessors, (105), 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:48,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:26:48,087 INFO L93 Difference]: Finished difference Result 1385 states and 1741 transitions. [2025-03-04 09:26:48,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:26:48,088 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.5) internal successors, (105), 15 states have internal predecessors, (105), 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 107 [2025-03-04 09:26:48,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:26:48,089 INFO L225 Difference]: With dead ends: 1385 [2025-03-04 09:26:48,089 INFO L226 Difference]: Without dead ends: 1385 [2025-03-04 09:26:48,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2025-03-04 09:26:48,090 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 723 mSDsluCounter, 4143 mSDsCounter, 0 mSdLazyCounter, 3284 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 4614 SdHoareTripleChecker+Invalid, 3301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:26:48,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 4614 Invalid, 3301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3284 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 09:26:48,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2025-03-04 09:26:48,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1381. [2025-03-04 09:26:48,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1145 states have (on average 1.5048034934497816) internal successors, (1723), 1371 states have internal predecessors, (1723), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:26:48,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1735 transitions. [2025-03-04 09:26:48,100 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1735 transitions. Word has length 107 [2025-03-04 09:26:48,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:26:48,100 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1735 transitions. [2025-03-04 09:26:48,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.5) internal successors, (105), 15 states have internal predecessors, (105), 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:48,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1735 transitions. [2025-03-04 09:26:48,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 09:26:48,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:26:48,100 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, 1, 1, 1, 1] [2025-03-04 09:26:48,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-04 09:26:48,101 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr293REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:26:48,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:26:48,101 INFO L85 PathProgramCache]: Analyzing trace with hash 445791518, now seen corresponding path program 1 times [2025-03-04 09:26:48,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:26:48,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948521088] [2025-03-04 09:26:48,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:48,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:26:48,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 09:26:48,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 09:26:48,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:48,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:48,997 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:48,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:26:48,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948521088] [2025-03-04 09:26:48,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948521088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:26:48,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:26:48,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 09:26:48,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926730044] [2025-03-04 09:26:48,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:26:48,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 09:26:48,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:26:48,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 09:26:48,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-04 09:26:48,998 INFO L87 Difference]: Start difference. First operand 1381 states and 1735 transitions. Second operand has 16 states, 15 states have (on average 7.0) internal successors, (105), 16 states have internal predecessors, (105), 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:50,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:26:50,948 INFO L93 Difference]: Finished difference Result 1384 states and 1739 transitions. [2025-03-04 09:26:50,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 09:26:50,948 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 7.0) internal successors, (105), 16 states have internal predecessors, (105), 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 107 [2025-03-04 09:26:50,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:26:50,949 INFO L225 Difference]: With dead ends: 1384 [2025-03-04 09:26:50,949 INFO L226 Difference]: Without dead ends: 1384 [2025-03-04 09:26:50,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2025-03-04 09:26:50,950 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 727 mSDsluCounter, 3106 mSDsCounter, 0 mSdLazyCounter, 3498 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 3578 SdHoareTripleChecker+Invalid, 3509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:26:50,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 3578 Invalid, 3509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3498 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 09:26:50,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2025-03-04 09:26:50,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1381. [2025-03-04 09:26:50,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1145 states have (on average 1.503056768558952) internal successors, (1721), 1371 states have internal predecessors, (1721), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:26:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1733 transitions. [2025-03-04 09:26:50,961 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1733 transitions. Word has length 107 [2025-03-04 09:26:50,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:26:50,961 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1733 transitions. [2025-03-04 09:26:50,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 7.0) internal successors, (105), 16 states have internal predecessors, (105), 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:50,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1733 transitions. [2025-03-04 09:26:50,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 09:26:50,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:26:50,962 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, 1, 1, 1, 1, 1] [2025-03-04 09:26:50,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-04 09:26:50,962 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr292REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:26:50,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:26:50,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1817318885, now seen corresponding path program 1 times [2025-03-04 09:26:50,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:26:50,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442661581] [2025-03-04 09:26:50,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:50,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:26:50,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 09:26:50,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 09:26:50,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:50,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:26:51,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 09:26:51,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:26:51,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442661581] [2025-03-04 09:26:51,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442661581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:26:51,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:26:51,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:26:51,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703085607] [2025-03-04 09:26:51,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:26:51,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:26:51,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:26:51,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:26:51,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:26:51,347 INFO L87 Difference]: Start difference. First operand 1381 states and 1733 transitions. Second operand has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 states have internal predecessors, (106), 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:51,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:26:51,965 INFO L93 Difference]: Finished difference Result 1380 states and 1731 transitions. [2025-03-04 09:26:51,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:26:51,965 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 states have internal predecessors, (106), 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 108 [2025-03-04 09:26:51,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:26:51,966 INFO L225 Difference]: With dead ends: 1380 [2025-03-04 09:26:51,966 INFO L226 Difference]: Without dead ends: 1380 [2025-03-04 09:26:51,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:26:51,967 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 2 mSDsluCounter, 2027 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2782 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:26:51,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2782 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 09:26:51,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2025-03-04 09:26:51,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1380. [2025-03-04 09:26:51,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1145 states have (on average 1.5013100436681224) internal successors, (1719), 1370 states have internal predecessors, (1719), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 09:26:51,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1731 transitions. [2025-03-04 09:26:51,975 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1731 transitions. Word has length 108 [2025-03-04 09:26:51,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:26:51,975 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 1731 transitions. [2025-03-04 09:26:51,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 states have internal predecessors, (106), 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:51,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1731 transitions. [2025-03-04 09:26:51,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 09:26:51,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:26:51,976 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, 1, 1, 1, 1, 1] [2025-03-04 09:26:51,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-04 09:26:51,976 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr293REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-03-04 09:26:51,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:26:51,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1817318886, now seen corresponding path program 1 times [2025-03-04 09:26:51,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:26:51,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906998596] [2025-03-04 09:26:51,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:26:51,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:26:51,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 09:26:52,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 09:26:52,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:26:52,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat