./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed 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/memsafety-ext2/optional_data_creation_test04-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 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:51:34,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:51:35,014 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 22:51:35,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:51:35,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:51:35,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:51:35,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:51:35,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:51:35,039 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:51:35,039 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:51:35,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:51:35,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:51:35,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:51:35,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:51:35,041 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:51:35,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:51:35,041 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:51:35,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:51:35,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:51:35,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:51:35,041 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:51:35,042 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:51:35,042 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:51:35,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:51:35,042 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:51:35,042 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:51:35,042 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:51:35,042 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:51:35,042 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:51:35,042 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:51:35,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:51:35,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:51:35,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:51:35,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:51:35,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:51:35,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:51:35,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:51:35,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:51:35,043 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:51:35,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:51:35,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:51:35,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:51:35,044 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 -> 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 [2025-03-08 22:51:35,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:51:35,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:51:35,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:51:35,291 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:51:35,291 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:51:35,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2025-03-08 22:51:36,494 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a40faffd9/0c57518067f246c18c919965ef2fbe05/FLAG1b0d8c54d [2025-03-08 22:51:36,795 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:51:36,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2025-03-08 22:51:36,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a40faffd9/0c57518067f246c18c919965ef2fbe05/FLAG1b0d8c54d [2025-03-08 22:51:37,068 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a40faffd9/0c57518067f246c18c919965ef2fbe05 [2025-03-08 22:51:37,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:51:37,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:51:37,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:51:37,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:51:37,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:51:37,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:51:37" (1/1) ... [2025-03-08 22:51:37,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c1d7632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:37, skipping insertion in model container [2025-03-08 22:51:37,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:51:37" (1/1) ... [2025-03-08 22:51:37,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:51:37,281 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-08 22:51:37,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:51:37,300 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:51:37,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:51:37,366 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:51:37,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:37 WrapperNode [2025-03-08 22:51:37,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:51:37,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:51:37,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:51:37,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:51:37,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:37" (1/1) ... [2025-03-08 22:51:37,381 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:37" (1/1) ... [2025-03-08 22:51:37,399 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 115 [2025-03-08 22:51:37,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:51:37,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:51:37,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:51:37,401 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:51:37,407 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:37" (1/1) ... [2025-03-08 22:51:37,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:37" (1/1) ... [2025-03-08 22:51:37,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:37" (1/1) ... [2025-03-08 22:51:37,425 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 11, 8]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 8 writes are split as follows [0, 6, 2]. [2025-03-08 22:51:37,425 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:37" (1/1) ... [2025-03-08 22:51:37,425 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:37" (1/1) ... [2025-03-08 22:51:37,435 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:37" (1/1) ... [2025-03-08 22:51:37,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:37" (1/1) ... [2025-03-08 22:51:37,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:37" (1/1) ... [2025-03-08 22:51:37,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:37" (1/1) ... [2025-03-08 22:51:37,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:51:37,442 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:51:37,442 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:51:37,442 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:51:37,442 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:37" (1/1) ... [2025-03-08 22:51:37,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:51:37,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:51:37,468 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-08 22:51:37,470 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-08 22:51:37,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:51:37,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 22:51:37,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 22:51:37,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:51:37,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:51:37,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:51:37,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 22:51:37,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 22:51:37,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 22:51:37,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:51:37,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:51:37,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 22:51:37,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:51:37,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 22:51:37,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 22:51:37,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 22:51:37,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:51:37,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:51:37,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 22:51:37,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:51:37,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:51:37,589 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:51:37,594 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:51:37,869 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L582: call ULTIMATE.dealloc(main_~#list~0#1.base, main_~#list~0#1.offset);havoc main_~#list~0#1.base, main_~#list~0#1.offset; [2025-03-08 22:51:37,882 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-03-08 22:51:37,882 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:51:37,889 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:51:37,890 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:51:37,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:51:37 BoogieIcfgContainer [2025-03-08 22:51:37,890 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:51:37,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:51:37,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:51:37,896 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:51:37,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:51:37" (1/3) ... [2025-03-08 22:51:37,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef8f638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:51:37, skipping insertion in model container [2025-03-08 22:51:37,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:37" (2/3) ... [2025-03-08 22:51:37,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef8f638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:51:37, skipping insertion in model container [2025-03-08 22:51:37,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:51:37" (3/3) ... [2025-03-08 22:51:37,899 INFO L128 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2025-03-08 22:51:37,912 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:51:37,913 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG optional_data_creation_test04-1.i that has 1 procedures, 100 locations, 1 initial locations, 3 loop locations, and 46 error locations. [2025-03-08 22:51:37,953 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:51:37,962 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;@4abaf7f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:51:37,962 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-03-08 22:51:37,966 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 53 states have (on average 2.0377358490566038) internal successors, (108), 99 states have internal predecessors, (108), 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-08 22:51:37,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 22:51:37,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:37,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 22:51:37,970 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:37,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:37,976 INFO L85 PathProgramCache]: Analyzing trace with hash 4401054, now seen corresponding path program 1 times [2025-03-08 22:51:37,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:37,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058799137] [2025-03-08 22:51:37,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:37,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:38,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 22:51:38,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 22:51:38,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:38,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:38,237 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-08 22:51:38,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:38,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058799137] [2025-03-08 22:51:38,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058799137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:38,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:38,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:51:38,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488637160] [2025-03-08 22:51:38,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:38,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:51:38,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:38,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:51:38,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:51:38,262 INFO L87 Difference]: Start difference. First operand has 100 states, 53 states have (on average 2.0377358490566038) internal successors, (108), 99 states have internal predecessors, (108), 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) 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-08 22:51:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:38,415 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2025-03-08 22:51:38,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:51:38,417 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-08 22:51:38,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:38,421 INFO L225 Difference]: With dead ends: 103 [2025-03-08 22:51:38,421 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 22:51:38,422 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-08 22:51:38,423 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 115 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:38,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 93 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:38,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 22:51:38,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2025-03-08 22:51:38,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 94 states have internal predecessors, (102), 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-08 22:51:38,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2025-03-08 22:51:38,448 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 4 [2025-03-08 22:51:38,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:38,449 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2025-03-08 22:51:38,449 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-08 22:51:38,449 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2025-03-08 22:51:38,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 22:51:38,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:38,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 22:51:38,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:51:38,450 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:38,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:38,450 INFO L85 PathProgramCache]: Analyzing trace with hash 4401055, now seen corresponding path program 1 times [2025-03-08 22:51:38,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:38,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931406440] [2025-03-08 22:51:38,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:38,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:38,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 22:51:38,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 22:51:38,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:38,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:38,603 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-08 22:51:38,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:38,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931406440] [2025-03-08 22:51:38,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931406440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:38,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:38,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:51:38,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662336981] [2025-03-08 22:51:38,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:38,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:51:38,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:38,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:51:38,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:51:38,606 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. 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-08 22:51:38,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:38,761 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2025-03-08 22:51:38,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:51:38,762 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-08 22:51:38,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:38,762 INFO L225 Difference]: With dead ends: 134 [2025-03-08 22:51:38,762 INFO L226 Difference]: Without dead ends: 134 [2025-03-08 22:51:38,762 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-08 22:51:38,763 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 112 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:38,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 97 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:38,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-08 22:51:38,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 104. [2025-03-08 22:51:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 65 states have (on average 1.8) internal successors, (117), 103 states have internal predecessors, (117), 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-08 22:51:38,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2025-03-08 22:51:38,771 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 4 [2025-03-08 22:51:38,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:38,772 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2025-03-08 22:51:38,772 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-08 22:51:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2025-03-08 22:51:38,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 22:51:38,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:38,773 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 22:51:38,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:51:38,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:38,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:38,773 INFO L85 PathProgramCache]: Analyzing trace with hash 136432748, now seen corresponding path program 1 times [2025-03-08 22:51:38,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:38,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237134654] [2025-03-08 22:51:38,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:38,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:38,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 22:51:38,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 22:51:38,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:38,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:38,821 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-08 22:51:38,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:38,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237134654] [2025-03-08 22:51:38,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237134654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:38,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:38,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:51:38,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312495224] [2025-03-08 22:51:38,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:38,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:51:38,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:38,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:51:38,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:51:38,822 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:38,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:38,878 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2025-03-08 22:51:38,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:51:38,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-08 22:51:38,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:38,881 INFO L225 Difference]: With dead ends: 102 [2025-03-08 22:51:38,882 INFO L226 Difference]: Without dead ends: 102 [2025-03-08 22:51:38,883 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-08 22:51:38,883 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 29 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:38,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 110 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:38,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-08 22:51:38,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-08 22:51:38,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 65 states have (on average 1.7692307692307692) internal successors, (115), 101 states have internal predecessors, (115), 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-08 22:51:38,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2025-03-08 22:51:38,887 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 5 [2025-03-08 22:51:38,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:38,888 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2025-03-08 22:51:38,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:38,888 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2025-03-08 22:51:38,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 22:51:38,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:38,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 22:51:38,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:51:38,888 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:38,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:38,889 INFO L85 PathProgramCache]: Analyzing trace with hash 136432749, now seen corresponding path program 1 times [2025-03-08 22:51:38,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:38,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395695518] [2025-03-08 22:51:38,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:38,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:38,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 22:51:38,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 22:51:38,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:38,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:38,960 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-08 22:51:38,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:38,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395695518] [2025-03-08 22:51:38,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395695518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:38,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:38,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:51:38,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525214937] [2025-03-08 22:51:38,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:38,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:51:38,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:38,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:51:38,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:51:38,962 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:39,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:39,005 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2025-03-08 22:51:39,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:51:39,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-08 22:51:39,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:39,006 INFO L225 Difference]: With dead ends: 100 [2025-03-08 22:51:39,007 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 22:51:39,007 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-08 22:51:39,009 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 29 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:39,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 115 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:51:39,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 22:51:39,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-08 22:51:39,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 65 states have (on average 1.7384615384615385) internal successors, (113), 99 states have internal predecessors, (113), 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-08 22:51:39,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2025-03-08 22:51:39,019 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 5 [2025-03-08 22:51:39,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:39,019 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2025-03-08 22:51:39,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:39,019 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2025-03-08 22:51:39,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 22:51:39,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:39,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:39,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:51:39,020 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:39,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:39,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1349516329, now seen corresponding path program 1 times [2025-03-08 22:51:39,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:39,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321100360] [2025-03-08 22:51:39,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:39,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:39,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 22:51:39,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 22:51:39,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:39,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:39,102 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-08 22:51:39,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:39,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321100360] [2025-03-08 22:51:39,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321100360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:39,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:39,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:51:39,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915504958] [2025-03-08 22:51:39,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:39,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:51:39,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:39,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:51:39,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:51:39,105 INFO L87 Difference]: Start difference. First operand 100 states and 113 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-08 22:51:39,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:39,167 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2025-03-08 22:51:39,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:51:39,167 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-08 22:51:39,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:39,168 INFO L225 Difference]: With dead ends: 96 [2025-03-08 22:51:39,168 INFO L226 Difference]: Without dead ends: 96 [2025-03-08 22:51:39,169 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-08 22:51:39,169 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 13 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:39,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 118 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:39,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-08 22:51:39,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-08 22:51:39,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.676923076923077) internal successors, (109), 95 states have internal predecessors, (109), 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-08 22:51:39,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2025-03-08 22:51:39,173 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 9 [2025-03-08 22:51:39,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:39,173 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2025-03-08 22:51:39,173 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-08 22:51:39,173 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2025-03-08 22:51:39,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 22:51:39,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:39,174 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:39,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:51:39,174 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:39,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:39,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1349516328, now seen corresponding path program 1 times [2025-03-08 22:51:39,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:39,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635233557] [2025-03-08 22:51:39,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:39,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:39,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 22:51:39,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 22:51:39,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:39,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:39,220 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-08 22:51:39,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:39,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635233557] [2025-03-08 22:51:39,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635233557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:39,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:39,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:51:39,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708352860] [2025-03-08 22:51:39,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:39,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:51:39,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:39,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:51:39,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:51:39,223 INFO L87 Difference]: Start difference. First operand 96 states and 109 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-08 22:51:39,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:39,272 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2025-03-08 22:51:39,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:51:39,272 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-08 22:51:39,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:39,273 INFO L225 Difference]: With dead ends: 92 [2025-03-08 22:51:39,274 INFO L226 Difference]: Without dead ends: 92 [2025-03-08 22:51:39,274 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-08 22:51:39,274 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 13 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:39,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 113 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:51:39,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-08 22:51:39,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-08 22:51:39,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 65 states have (on average 1.6153846153846154) internal successors, (105), 91 states have internal predecessors, (105), 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-08 22:51:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2025-03-08 22:51:39,277 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 9 [2025-03-08 22:51:39,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:39,282 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2025-03-08 22:51:39,282 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-08 22:51:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2025-03-08 22:51:39,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 22:51:39,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:39,282 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:39,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:51:39,283 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:39,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:39,283 INFO L85 PathProgramCache]: Analyzing trace with hash 257796813, now seen corresponding path program 1 times [2025-03-08 22:51:39,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:39,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149378096] [2025-03-08 22:51:39,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:39,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:39,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:51:39,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:51:39,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:39,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:39,375 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-08 22:51:39,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:39,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149378096] [2025-03-08 22:51:39,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149378096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:39,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:39,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:51:39,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758364949] [2025-03-08 22:51:39,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:39,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:51:39,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:39,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:51:39,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:39,376 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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-08 22:51:39,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:39,465 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2025-03-08 22:51:39,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:51:39,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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-08 22:51:39,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:39,466 INFO L225 Difference]: With dead ends: 100 [2025-03-08 22:51:39,466 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 22:51:39,466 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-08 22:51:39,467 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 5 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:39,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 213 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:39,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 22:51:39,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2025-03-08 22:51:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 69 states have (on average 1.608695652173913) internal successors, (111), 95 states have internal predecessors, (111), 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-08 22:51:39,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2025-03-08 22:51:39,472 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 14 [2025-03-08 22:51:39,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:39,473 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2025-03-08 22:51:39,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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-08 22:51:39,473 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2025-03-08 22:51:39,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 22:51:39,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:39,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:39,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:51:39,474 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:39,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:39,475 INFO L85 PathProgramCache]: Analyzing trace with hash 257796814, now seen corresponding path program 1 times [2025-03-08 22:51:39,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:39,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746850499] [2025-03-08 22:51:39,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:39,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:39,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:51:39,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:51:39,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:39,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:39,689 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-08 22:51:39,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:39,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746850499] [2025-03-08 22:51:39,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746850499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:39,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:39,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:51:39,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351345417] [2025-03-08 22:51:39,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:39,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:51:39,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:39,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:51:39,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:51:39,691 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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-08 22:51:39,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:39,801 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2025-03-08 22:51:39,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:51:39,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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-08 22:51:39,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:39,802 INFO L225 Difference]: With dead ends: 96 [2025-03-08 22:51:39,802 INFO L226 Difference]: Without dead ends: 96 [2025-03-08 22:51:39,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:51:39,803 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 4 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:39,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 222 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:39,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-08 22:51:39,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-08 22:51:39,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 69 states have (on average 1.5797101449275361) internal successors, (109), 95 states have internal predecessors, (109), 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-08 22:51:39,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2025-03-08 22:51:39,809 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 14 [2025-03-08 22:51:39,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:39,809 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2025-03-08 22:51:39,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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-08 22:51:39,809 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2025-03-08 22:51:39,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 22:51:39,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:39,810 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:39,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:51:39,810 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:39,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:39,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1552595485, now seen corresponding path program 1 times [2025-03-08 22:51:39,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:39,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121036760] [2025-03-08 22:51:39,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:39,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:39,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 22:51:39,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:51:39,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:39,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:39,917 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-08 22:51:39,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:39,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121036760] [2025-03-08 22:51:39,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121036760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:39,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:39,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:51:39,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937719815] [2025-03-08 22:51:39,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:39,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:51:39,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:39,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:51:39,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:51:39,919 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-08 22:51:40,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:40,068 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2025-03-08 22:51:40,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:51:40,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2025-03-08 22:51:40,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:40,069 INFO L225 Difference]: With dead ends: 152 [2025-03-08 22:51:40,069 INFO L226 Difference]: Without dead ends: 152 [2025-03-08 22:51:40,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:51:40,069 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 93 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:40,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 194 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:40,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-08 22:51:40,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 96. [2025-03-08 22:51:40,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 69 states have (on average 1.565217391304348) internal successors, (108), 95 states have internal predecessors, (108), 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-08 22:51:40,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2025-03-08 22:51:40,072 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 17 [2025-03-08 22:51:40,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:40,073 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2025-03-08 22:51:40,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-08 22:51:40,073 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2025-03-08 22:51:40,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 22:51:40,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:40,073 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:40,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:51:40,073 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:40,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:40,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1552595486, now seen corresponding path program 1 times [2025-03-08 22:51:40,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:40,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082765050] [2025-03-08 22:51:40,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:40,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:40,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 22:51:40,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:51:40,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:40,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:40,254 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-08 22:51:40,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:40,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082765050] [2025-03-08 22:51:40,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082765050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:40,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:40,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:51:40,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312040161] [2025-03-08 22:51:40,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:40,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:51:40,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:40,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:51:40,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:40,256 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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-08 22:51:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:40,385 INFO L93 Difference]: Finished difference Result 154 states and 171 transitions. [2025-03-08 22:51:40,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:51:40,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2025-03-08 22:51:40,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:40,387 INFO L225 Difference]: With dead ends: 154 [2025-03-08 22:51:40,387 INFO L226 Difference]: Without dead ends: 154 [2025-03-08 22:51:40,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:51:40,388 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 77 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:40,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 210 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:40,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-08 22:51:40,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 96. [2025-03-08 22:51:40,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 95 states have internal predecessors, (107), 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-08 22:51:40,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2025-03-08 22:51:40,391 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 17 [2025-03-08 22:51:40,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:40,391 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2025-03-08 22:51:40,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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-08 22:51:40,392 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2025-03-08 22:51:40,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 22:51:40,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:40,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:40,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:51:40,392 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:40,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:40,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1552594877, now seen corresponding path program 1 times [2025-03-08 22:51:40,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:40,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537291620] [2025-03-08 22:51:40,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:40,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:40,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 22:51:40,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:51:40,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:40,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:40,487 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-08 22:51:40,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:40,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537291620] [2025-03-08 22:51:40,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537291620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:40,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:40,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:51:40,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246384561] [2025-03-08 22:51:40,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:40,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:51:40,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:40,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:51:40,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:40,489 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-08 22:51:40,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:40,559 INFO L93 Difference]: Finished difference Result 153 states and 169 transitions. [2025-03-08 22:51:40,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:51:40,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2025-03-08 22:51:40,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:40,560 INFO L225 Difference]: With dead ends: 153 [2025-03-08 22:51:40,560 INFO L226 Difference]: Without dead ends: 153 [2025-03-08 22:51:40,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:51:40,561 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 83 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:40,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 288 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:40,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-08 22:51:40,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 96. [2025-03-08 22:51:40,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 69 states have (on average 1.536231884057971) internal successors, (106), 95 states have internal predecessors, (106), 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-08 22:51:40,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2025-03-08 22:51:40,565 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 17 [2025-03-08 22:51:40,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:40,565 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2025-03-08 22:51:40,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-08 22:51:40,565 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2025-03-08 22:51:40,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 22:51:40,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:40,565 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:40,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:51:40,566 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:40,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:40,566 INFO L85 PathProgramCache]: Analyzing trace with hash 2068436799, now seen corresponding path program 1 times [2025-03-08 22:51:40,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:40,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474866706] [2025-03-08 22:51:40,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:40,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:40,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:51:40,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:51:40,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:40,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:40,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:40,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:40,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474866706] [2025-03-08 22:51:40,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474866706] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:51:40,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836513397] [2025-03-08 22:51:40,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:40,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:40,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:51:40,751 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-08 22:51:40,753 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-08 22:51:40,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:51:40,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:51:40,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:40,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:40,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 22:51:40,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:51:40,859 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-08 22:51:40,893 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 22:51:40,893 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-08 22:51:40,926 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-08 22:51:41,014 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 22:51:41,015 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-08 22:51:41,039 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-08 22:51:41,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:51:41,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:51:41,111 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_203 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_203) |c_ULTIMATE.start_create_data_~data~0#1.base|) (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) 1)) is different from false [2025-03-08 22:51:41,122 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_203 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) v_ArrVal_203) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) 1)) is different from false [2025-03-08 22:51:41,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:41,138 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-03-08 22:51:41,142 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 40 treesize of output 28 [2025-03-08 22:51:41,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 5 [2025-03-08 22:51:41,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-08 22:51:41,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836513397] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:51:41,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:51:41,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2025-03-08 22:51:41,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967858074] [2025-03-08 22:51:41,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:51:41,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 22:51:41,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:41,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 22:51:41,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=138, Unknown=2, NotChecked=50, Total=240 [2025-03-08 22:51:41,208 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 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-08 22:51:41,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:41,420 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2025-03-08 22:51:41,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:51:41,420 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 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-08 22:51:41,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:41,421 INFO L225 Difference]: With dead ends: 98 [2025-03-08 22:51:41,421 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 22:51:41,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=138, Unknown=2, NotChecked=50, Total=240 [2025-03-08 22:51:41,421 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 11 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:41,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 473 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 335 Invalid, 0 Unknown, 97 Unchecked, 0.2s Time] [2025-03-08 22:51:41,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 22:51:41,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2025-03-08 22:51:41,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.5217391304347827) internal successors, (105), 94 states have internal predecessors, (105), 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-08 22:51:41,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2025-03-08 22:51:41,424 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 19 [2025-03-08 22:51:41,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:41,424 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2025-03-08 22:51:41,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 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-08 22:51:41,424 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2025-03-08 22:51:41,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 22:51:41,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:41,425 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:41,432 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-08 22:51:41,625 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,SelfDestructingSolverStorable11 [2025-03-08 22:51:41,626 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:41,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:41,627 INFO L85 PathProgramCache]: Analyzing trace with hash 2068436800, now seen corresponding path program 1 times [2025-03-08 22:51:41,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:41,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467826043] [2025-03-08 22:51:41,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:41,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:41,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:51:41,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:51:41,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:41,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:41,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:41,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:41,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467826043] [2025-03-08 22:51:41,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467826043] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:51:41,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459685826] [2025-03-08 22:51:41,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:41,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:41,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:51:41,950 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-08 22:51:41,951 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-08 22:51:42,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:51:42,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:51:42,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:42,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:42,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 22:51:42,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:51:42,026 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-08 22:51:42,039 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-08 22:51:42,045 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:51:42,046 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-08 22:51:42,059 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-08 22:51:42,063 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-08 22:51:42,137 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 22:51:42,138 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-08 22:51:42,145 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-08 22:51:42,189 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-08 22:51:42,195 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-08 22:51:42,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:42,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:51:42,298 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4)) (.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))) (forall ((v_ArrVal_261 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 4))))) is different from false [2025-03-08 22:51:42,320 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_261 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 4))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_262) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))) is different from false [2025-03-08 22:51:42,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:42,374 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-03-08 22:51:42,377 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 40 treesize of output 28 [2025-03-08 22:51:42,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:42,387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2025-03-08 22:51:42,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:42,393 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2025-03-08 22:51:42,396 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:51:42,400 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 33 treesize of output 21 [2025-03-08 22:51:42,402 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:51:42,403 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 24 treesize of output 12 [2025-03-08 22:51:42,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-08 22:51:42,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459685826] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:51:42,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:51:42,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 20 [2025-03-08 22:51:42,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381249167] [2025-03-08 22:51:42,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:51:42,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 22:51:42,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:42,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 22:51:42,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=275, Unknown=6, NotChecked=70, Total=420 [2025-03-08 22:51:42,442 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand has 21 states, 20 states have (on average 2.0) internal successors, (40), 21 states have internal predecessors, (40), 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-08 22:51:42,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:42,798 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2025-03-08 22:51:42,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:51:42,798 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.0) internal successors, (40), 21 states have internal predecessors, (40), 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-08 22:51:42,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:42,799 INFO L225 Difference]: With dead ends: 100 [2025-03-08 22:51:42,799 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 22:51:42,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=469, Unknown=6, NotChecked=94, Total=702 [2025-03-08 22:51:42,799 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 32 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:42,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 639 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 445 Invalid, 0 Unknown, 100 Unchecked, 0.2s Time] [2025-03-08 22:51:42,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 22:51:42,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-08 22:51:42,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.4864864864864864) internal successors, (110), 99 states have internal predecessors, (110), 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-08 22:51:42,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2025-03-08 22:51:42,802 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 19 [2025-03-08 22:51:42,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:42,802 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2025-03-08 22:51:42,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.0) internal successors, (40), 21 states have internal predecessors, (40), 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-08 22:51:42,802 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2025-03-08 22:51:42,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 22:51:42,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:42,803 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] [2025-03-08 22:51:42,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 22:51:43,004 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,SelfDestructingSolverStorable12 [2025-03-08 22:51:43,005 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:43,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:43,005 INFO L85 PathProgramCache]: Analyzing trace with hash 869301779, now seen corresponding path program 1 times [2025-03-08 22:51:43,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:43,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966364724] [2025-03-08 22:51:43,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:43,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:43,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 22:51:43,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 22:51:43,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:43,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:43,130 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-08 22:51:43,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:43,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966364724] [2025-03-08 22:51:43,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966364724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:43,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:43,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:51:43,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551567513] [2025-03-08 22:51:43,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:43,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:51:43,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:43,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:51:43,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:51:43,131 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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-08 22:51:43,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:43,261 INFO L93 Difference]: Finished difference Result 157 states and 169 transitions. [2025-03-08 22:51:43,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:51:43,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 20 [2025-03-08 22:51:43,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:43,262 INFO L225 Difference]: With dead ends: 157 [2025-03-08 22:51:43,262 INFO L226 Difference]: Without dead ends: 157 [2025-03-08 22:51:43,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:51:43,263 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 68 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:43,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 224 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:43,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-08 22:51:43,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 100. [2025-03-08 22:51:43,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.472972972972973) internal successors, (109), 99 states have internal predecessors, (109), 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-08 22:51:43,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2025-03-08 22:51:43,265 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 20 [2025-03-08 22:51:43,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:43,265 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2025-03-08 22:51:43,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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-08 22:51:43,265 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2025-03-08 22:51:43,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 22:51:43,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51: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] [2025-03-08 22:51:43,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:51:43,267 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:43,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:43,267 INFO L85 PathProgramCache]: Analyzing trace with hash 869301780, now seen corresponding path program 1 times [2025-03-08 22:51:43,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:43,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067110765] [2025-03-08 22:51:43,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:43,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:43,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 22:51:43,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 22:51:43,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:43,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:43,375 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-08 22:51:43,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:43,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067110765] [2025-03-08 22:51:43,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067110765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:43,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:43,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:51:43,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532596283] [2025-03-08 22:51:43,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:43,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:51:43,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:43,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:51:43,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:43,378 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-08 22:51:43,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:43,501 INFO L93 Difference]: Finished difference Result 159 states and 175 transitions. [2025-03-08 22:51:43,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:51:43,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2025-03-08 22:51:43,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:43,503 INFO L225 Difference]: With dead ends: 159 [2025-03-08 22:51:43,503 INFO L226 Difference]: Without dead ends: 159 [2025-03-08 22:51:43,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:51:43,503 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 69 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:43,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 208 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:43,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-08 22:51:43,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 100. [2025-03-08 22:51:43,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 99 states have internal predecessors, (108), 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-08 22:51:43,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2025-03-08 22:51:43,507 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 20 [2025-03-08 22:51:43,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:43,507 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2025-03-08 22:51:43,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-08 22:51:43,507 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2025-03-08 22:51:43,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 22:51:43,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:43,509 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] [2025-03-08 22:51:43,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:51:43,509 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:43,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:43,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1283484812, now seen corresponding path program 1 times [2025-03-08 22:51:43,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:43,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463504457] [2025-03-08 22:51:43,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:43,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:43,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:51:43,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:51:43,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:43,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:43,720 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-08 22:51:43,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:43,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463504457] [2025-03-08 22:51:43,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463504457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:43,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:43,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:51:43,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903397104] [2025-03-08 22:51:43,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:43,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:51:43,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:43,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:51:43,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:51:43,722 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-08 22:51:43,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:43,859 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2025-03-08 22:51:43,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:51:43,860 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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 23 [2025-03-08 22:51:43,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:43,860 INFO L225 Difference]: With dead ends: 127 [2025-03-08 22:51:43,860 INFO L226 Difference]: Without dead ends: 127 [2025-03-08 22:51:43,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:51:43,861 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 34 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:43,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 393 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:43,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-08 22:51:43,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2025-03-08 22:51:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 114 states have internal predecessors, (124), 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-08 22:51:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2025-03-08 22:51:43,863 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 23 [2025-03-08 22:51:43,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:43,863 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2025-03-08 22:51:43,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-08 22:51:43,863 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2025-03-08 22:51:43,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 22:51:43,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:43,863 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:43,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:51:43,863 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:43,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:43,864 INFO L85 PathProgramCache]: Analyzing trace with hash 2057413134, now seen corresponding path program 2 times [2025-03-08 22:51:43,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:43,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878010309] [2025-03-08 22:51:43,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:51:43,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:43,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-08 22:51:43,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 22:51:43,894 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:51:43,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:44,259 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:44,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:44,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878010309] [2025-03-08 22:51:44,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878010309] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:51:44,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091259048] [2025-03-08 22:51:44,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:51:44,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:44,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:51:44,261 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-08 22:51:44,263 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-08 22:51:44,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-08 22:51:44,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 22:51:44,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:51:44,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:44,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 22:51:44,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:51:44,350 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-08 22:51:44,358 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:51:44,359 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-08 22:51:44,362 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-08 22:51:44,371 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-08 22:51:44,375 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-08 22:51:44,438 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 22:51:44,439 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-08 22:51:44,443 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-08 22:51:44,524 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 22:51:44,525 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-08 22:51:44,529 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-08 22:51:44,571 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-08 22:51:44,576 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-08 22:51:44,596 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:44,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:51:44,691 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_401 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_401) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_401 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_401) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_400) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) is different from false [2025-03-08 22:51:44,760 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_401 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_401) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_400) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_401 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_401) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8)))))) is different from false [2025-03-08 22:51:44,772 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse0 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_398 (Array Int Int)) (v_ArrVal_401 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_398) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_399) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) v_ArrVal_401) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 8))) (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_398 (Array Int Int)) (v_ArrVal_401 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_399))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_398) .cse2 v_ArrVal_401) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_400) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))))))) is different from false [2025-03-08 22:51:44,873 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_398 (Array Int Int)) (v_ArrVal_401 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_399))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_398) .cse1 v_ArrVal_401) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_400) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_398 (Array Int Int)) (v_ArrVal_401 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_398) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_399) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_401) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8)))))) is different from false [2025-03-08 22:51:44,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:44,884 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2025-03-08 22:51:44,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:44,891 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2025-03-08 22:51:44,895 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 400 treesize of output 334 [2025-03-08 22:51:44,905 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 508 treesize of output 472 [2025-03-08 22:51:44,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 19 [2025-03-08 22:51:44,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 15 [2025-03-08 22:51:44,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 40 treesize of output 28 [2025-03-08 22:51:44,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 12 [2025-03-08 22:51:44,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:44,942 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2025-03-08 22:51:44,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:44,949 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2025-03-08 22:51:44,951 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:51:44,952 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 34 treesize of output 22 [2025-03-08 22:51:44,954 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:51:44,956 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 22 treesize of output 10 [2025-03-08 22:51:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 7 not checked. [2025-03-08 22:51:44,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091259048] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:51:44,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:51:44,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 27 [2025-03-08 22:51:44,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255792636] [2025-03-08 22:51:44,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:51:44,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 22:51:44,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:44,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 22:51:44,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=444, Unknown=14, NotChecked=188, Total=756 [2025-03-08 22:51:44,995 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 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-08 22:51:45,587 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_401 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_401) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_400) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (<= (+ .cse3 .cse2 8) (select |c_#length| .cse0)) (= (select |c_#valid| |c_ULTIMATE.start_create_data_~data~0#1.base|) 1) (forall ((v_ArrVal_401 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_401) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8))) (<= 0 (+ .cse3 .cse2 4))))) is different from false [2025-03-08 22:51:45,591 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (<= 0 (+ .cse0 .cse1)) (<= (+ .cse0 .cse1 4) (select |c_#length| .cse2)) (forall ((v_ArrVal_401 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_401) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse1 4))) (forall ((v_ArrVal_401 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_401) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_400) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) is different from false [2025-03-08 22:51:45,598 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_401 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_401) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 4))) (<= (+ .cse0 |c_ULTIMATE.start_create_data_#t~mem7#1.offset| 4) (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem7#1.base|)) (<= 0 (+ .cse0 |c_ULTIMATE.start_create_data_#t~mem7#1.offset|)) (forall ((v_ArrVal_401 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_401) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_400) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) is different from false [2025-03-08 22:51:45,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:45,772 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2025-03-08 22:51:45,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 22:51:45,773 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 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 24 [2025-03-08 22:51:45,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:45,773 INFO L225 Difference]: With dead ends: 132 [2025-03-08 22:51:45,773 INFO L226 Difference]: Without dead ends: 132 [2025-03-08 22:51:45,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=220, Invalid=847, Unknown=17, NotChecked=476, Total=1560 [2025-03-08 22:51:45,774 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 33 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 4 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 393 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:45,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 823 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 607 Invalid, 20 Unknown, 393 Unchecked, 0.5s Time] [2025-03-08 22:51:45,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-08 22:51:45,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2025-03-08 22:51:45,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 104 states have (on average 1.3557692307692308) internal successors, (141), 129 states have internal predecessors, (141), 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-08 22:51:45,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2025-03-08 22:51:45,777 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 24 [2025-03-08 22:51:45,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:45,777 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2025-03-08 22:51:45,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 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-08 22:51:45,777 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2025-03-08 22:51:45,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 22:51:45,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:45,778 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:45,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 22:51:45,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:45,979 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:45,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:45,980 INFO L85 PathProgramCache]: Analyzing trace with hash -773337951, now seen corresponding path program 1 times [2025-03-08 22:51:45,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:45,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861519885] [2025-03-08 22:51:45,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:45,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:45,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:51:45,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:51:45,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:45,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:46,071 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-08 22:51:46,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:46,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861519885] [2025-03-08 22:51:46,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861519885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:46,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:46,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:51:46,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619689145] [2025-03-08 22:51:46,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:46,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:51:46,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:46,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:51:46,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:46,072 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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-08 22:51:46,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:46,134 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2025-03-08 22:51:46,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:51:46,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 25 [2025-03-08 22:51:46,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:46,136 INFO L225 Difference]: With dead ends: 157 [2025-03-08 22:51:46,136 INFO L226 Difference]: Without dead ends: 157 [2025-03-08 22:51:46,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:51:46,137 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 68 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:46,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 220 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:51:46,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-08 22:51:46,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 142. [2025-03-08 22:51:46,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 116 states have (on average 1.4310344827586208) internal successors, (166), 141 states have internal predecessors, (166), 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-08 22:51:46,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 166 transitions. [2025-03-08 22:51:46,140 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 166 transitions. Word has length 25 [2025-03-08 22:51:46,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:46,140 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 166 transitions. [2025-03-08 22:51:46,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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-08 22:51:46,141 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 166 transitions. [2025-03-08 22:51:46,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 22:51:46,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:46,141 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:46,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:51:46,141 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:46,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:46,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1796327276, now seen corresponding path program 1 times [2025-03-08 22:51:46,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:46,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247875124] [2025-03-08 22:51:46,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:46,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:46,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:51:46,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:51:46,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:46,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:46,237 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-08 22:51:46,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:46,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247875124] [2025-03-08 22:51:46,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247875124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:46,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:46,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:51:46,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758979652] [2025-03-08 22:51:46,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:46,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:51:46,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:46,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:51:46,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:46,239 INFO L87 Difference]: Start difference. First operand 142 states and 166 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:46,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:46,340 INFO L93 Difference]: Finished difference Result 206 states and 227 transitions. [2025-03-08 22:51:46,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:51:46,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-08 22:51:46,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:46,341 INFO L225 Difference]: With dead ends: 206 [2025-03-08 22:51:46,341 INFO L226 Difference]: Without dead ends: 206 [2025-03-08 22:51:46,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:51:46,341 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 68 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:46,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 242 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:46,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-08 22:51:46,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 143. [2025-03-08 22:51:46,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 142 states have internal predecessors, (167), 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-08 22:51:46,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 167 transitions. [2025-03-08 22:51:46,347 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 167 transitions. Word has length 26 [2025-03-08 22:51:46,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:46,347 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 167 transitions. [2025-03-08 22:51:46,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:46,347 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 167 transitions. [2025-03-08 22:51:46,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 22:51:46,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:46,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:46,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:51:46,347 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:46,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:46,348 INFO L85 PathProgramCache]: Analyzing trace with hash -148429313, now seen corresponding path program 1 times [2025-03-08 22:51:46,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:46,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410434281] [2025-03-08 22:51:46,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:46,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:46,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 22:51:46,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 22:51:46,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:46,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:46,441 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-08 22:51:46,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:46,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410434281] [2025-03-08 22:51:46,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410434281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:46,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:46,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:51:46,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609819172] [2025-03-08 22:51:46,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:46,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:51:46,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:46,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:51:46,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:51:46,442 INFO L87 Difference]: Start difference. First operand 143 states and 167 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:46,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:46,569 INFO L93 Difference]: Finished difference Result 209 states and 231 transitions. [2025-03-08 22:51:46,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:51:46,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-08 22:51:46,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:46,571 INFO L225 Difference]: With dead ends: 209 [2025-03-08 22:51:46,571 INFO L226 Difference]: Without dead ends: 209 [2025-03-08 22:51:46,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:51:46,571 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 75 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:46,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 199 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:46,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-08 22:51:46,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 146. [2025-03-08 22:51:46,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 120 states have (on average 1.4166666666666667) internal successors, (170), 145 states have internal predecessors, (170), 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-08 22:51:46,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 170 transitions. [2025-03-08 22:51:46,576 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 170 transitions. Word has length 27 [2025-03-08 22:51:46,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:46,576 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 170 transitions. [2025-03-08 22:51:46,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:46,576 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 170 transitions. [2025-03-08 22:51:46,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 22:51:46,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:46,577 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-08 22:51:46,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:51:46,577 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:46,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:46,577 INFO L85 PathProgramCache]: Analyzing trace with hash -306341431, now seen corresponding path program 1 times [2025-03-08 22:51:46,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:46,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067467065] [2025-03-08 22:51:46,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:46,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:46,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:51:46,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:51:46,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:46,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:46,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:46,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:46,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067467065] [2025-03-08 22:51:46,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067467065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:46,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:46,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:51:46,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636422369] [2025-03-08 22:51:46,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:46,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:51:46,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:46,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:51:46,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:51:46,770 INFO L87 Difference]: Start difference. First operand 146 states and 170 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 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-08 22:51:46,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:46,896 INFO L93 Difference]: Finished difference Result 166 states and 184 transitions. [2025-03-08 22:51:46,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:51:46,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 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-08 22:51:46,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:46,898 INFO L225 Difference]: With dead ends: 166 [2025-03-08 22:51:46,898 INFO L226 Difference]: Without dead ends: 166 [2025-03-08 22:51:46,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:51:46,899 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 133 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:46,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 174 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:46,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-08 22:51:46,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 147. [2025-03-08 22:51:46,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 121 states have (on average 1.421487603305785) internal successors, (172), 146 states have internal predecessors, (172), 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-08 22:51:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2025-03-08 22:51:46,902 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 28 [2025-03-08 22:51:46,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:46,902 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2025-03-08 22:51:46,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 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-08 22:51:46,903 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2025-03-08 22:51:46,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 22:51:46,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:46,903 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-08 22:51:46,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 22:51:46,903 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:46,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:46,904 INFO L85 PathProgramCache]: Analyzing trace with hash -306341430, now seen corresponding path program 1 times [2025-03-08 22:51:46,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:46,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036302927] [2025-03-08 22:51:46,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:46,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:46,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:51:46,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:51:46,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:46,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:46,948 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-08 22:51:46,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:46,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036302927] [2025-03-08 22:51:46,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036302927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:46,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:46,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:51:46,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682327284] [2025-03-08 22:51:46,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:46,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:51:46,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:46,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:51:46,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:51:46,950 INFO L87 Difference]: Start difference. First operand 147 states and 172 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-08 22:51:46,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:46,989 INFO L93 Difference]: Finished difference Result 142 states and 164 transitions. [2025-03-08 22:51:46,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:51:46,989 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-08 22:51:46,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:46,990 INFO L225 Difference]: With dead ends: 142 [2025-03-08 22:51:46,990 INFO L226 Difference]: Without dead ends: 142 [2025-03-08 22:51:46,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:51:46,992 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 58 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:46,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 53 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:51:46,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-08 22:51:46,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-03-08 22:51:46,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 121 states have (on average 1.3553719008264462) internal successors, (164), 141 states have internal predecessors, (164), 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-08 22:51:46,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 164 transitions. [2025-03-08 22:51:46,997 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 164 transitions. Word has length 28 [2025-03-08 22:51:46,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:46,997 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 164 transitions. [2025-03-08 22:51:46,997 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-08 22:51:46,997 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 164 transitions. [2025-03-08 22:51:46,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 22:51:46,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:46,997 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-08 22:51:46,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:51:46,998 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:46,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:46,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1978361454, now seen corresponding path program 1 times [2025-03-08 22:51:46,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:46,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916309551] [2025-03-08 22:51:46,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:46,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:47,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:51:47,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:51:47,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:47,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:47,185 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-08 22:51:47,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:47,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916309551] [2025-03-08 22:51:47,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916309551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:47,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:47,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:51:47,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320802612] [2025-03-08 22:51:47,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:47,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:51:47,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:47,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:51:47,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:51:47,187 INFO L87 Difference]: Start difference. First operand 142 states and 164 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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-08 22:51:47,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:47,494 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2025-03-08 22:51:47,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:51:47,494 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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-08 22:51:47,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:47,495 INFO L225 Difference]: With dead ends: 163 [2025-03-08 22:51:47,495 INFO L226 Difference]: Without dead ends: 163 [2025-03-08 22:51:47,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-08 22:51:47,496 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 63 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:47,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 395 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:51:47,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-08 22:51:47,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 147. [2025-03-08 22:51:47,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 127 states have (on average 1.3464566929133859) internal successors, (171), 146 states have internal predecessors, (171), 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-08 22:51:47,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 171 transitions. [2025-03-08 22:51:47,499 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 171 transitions. Word has length 28 [2025-03-08 22:51:47,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:47,501 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 171 transitions. [2025-03-08 22:51:47,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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-08 22:51:47,501 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 171 transitions. [2025-03-08 22:51:47,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 22:51:47,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:47,502 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-08 22:51:47,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:51:47,502 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:47,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:47,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1978361453, now seen corresponding path program 1 times [2025-03-08 22:51:47,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:47,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320750015] [2025-03-08 22:51:47,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:47,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:47,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:51:47,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:51:47,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:47,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:47,776 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-08 22:51:47,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:47,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320750015] [2025-03-08 22:51:47,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320750015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:47,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:47,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:51:47,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243290530] [2025-03-08 22:51:47,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:47,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:51:47,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:47,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:51:47,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:51:47,778 INFO L87 Difference]: Start difference. First operand 147 states and 171 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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-08 22:51:48,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:48,092 INFO L93 Difference]: Finished difference Result 198 states and 228 transitions. [2025-03-08 22:51:48,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:51:48,092 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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-08 22:51:48,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:48,093 INFO L225 Difference]: With dead ends: 198 [2025-03-08 22:51:48,093 INFO L226 Difference]: Without dead ends: 198 [2025-03-08 22:51:48,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-08 22:51:48,093 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 55 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:48,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 477 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:51:48,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-08 22:51:48,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 173. [2025-03-08 22:51:48,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 153 states have (on average 1.326797385620915) internal successors, (203), 172 states have internal predecessors, (203), 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-08 22:51:48,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 203 transitions. [2025-03-08 22:51:48,102 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 203 transitions. Word has length 28 [2025-03-08 22:51:48,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:48,103 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 203 transitions. [2025-03-08 22:51:48,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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-08 22:51:48,103 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 203 transitions. [2025-03-08 22:51:48,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 22:51:48,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:48,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:48,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 22:51:48,103 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:48,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:48,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1824836528, now seen corresponding path program 1 times [2025-03-08 22:51:48,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:48,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117368501] [2025-03-08 22:51:48,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:48,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:48,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:51:48,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:51:48,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:48,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:48,148 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-08 22:51:48,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:48,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117368501] [2025-03-08 22:51:48,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117368501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:48,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:48,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:51:48,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848735299] [2025-03-08 22:51:48,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:48,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:51:48,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:48,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:51:48,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:48,151 INFO L87 Difference]: Start difference. First operand 173 states and 203 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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-08 22:51:48,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:48,205 INFO L93 Difference]: Finished difference Result 172 states and 200 transitions. [2025-03-08 22:51:48,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:51:48,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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 31 [2025-03-08 22:51:48,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:48,207 INFO L225 Difference]: With dead ends: 172 [2025-03-08 22:51:48,207 INFO L226 Difference]: Without dead ends: 172 [2025-03-08 22:51:48,207 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-08 22:51:48,208 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 6 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:48,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 237 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:51:48,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-08 22:51:48,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2025-03-08 22:51:48,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 153 states have (on average 1.3071895424836601) internal successors, (200), 171 states have internal predecessors, (200), 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-08 22:51:48,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 200 transitions. [2025-03-08 22:51:48,215 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 200 transitions. Word has length 31 [2025-03-08 22:51:48,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:48,215 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 200 transitions. [2025-03-08 22:51:48,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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-08 22:51:48,216 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 200 transitions. [2025-03-08 22:51:48,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 22:51:48,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:48,216 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] [2025-03-08 22:51:48,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 22:51:48,217 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:48,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:48,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1824835823, now seen corresponding path program 1 times [2025-03-08 22:51:48,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:48,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901913821] [2025-03-08 22:51:48,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:48,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:48,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:51:48,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:51:48,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:48,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:48,458 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-08 22:51:48,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:48,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901913821] [2025-03-08 22:51:48,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901913821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:48,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:48,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:51:48,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113028275] [2025-03-08 22:51:48,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:48,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:51:48,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:48,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:51:48,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:51:48,461 INFO L87 Difference]: Start difference. First operand 172 states and 200 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 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-08 22:51:48,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:48,739 INFO L93 Difference]: Finished difference Result 190 states and 211 transitions. [2025-03-08 22:51:48,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:51:48,739 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 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 31 [2025-03-08 22:51:48,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:48,740 INFO L225 Difference]: With dead ends: 190 [2025-03-08 22:51:48,740 INFO L226 Difference]: Without dead ends: 190 [2025-03-08 22:51:48,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-08 22:51:48,741 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 53 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:48,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 510 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:51:48,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-08 22:51:48,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 172. [2025-03-08 22:51:48,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 153 states have (on average 1.2941176470588236) internal successors, (198), 171 states have internal predecessors, (198), 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-08 22:51:48,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 198 transitions. [2025-03-08 22:51:48,745 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 198 transitions. Word has length 31 [2025-03-08 22:51:48,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:48,745 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 198 transitions. [2025-03-08 22:51:48,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 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-08 22:51:48,745 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 198 transitions. [2025-03-08 22:51:48,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 22:51:48,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:48,746 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] [2025-03-08 22:51:48,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 22:51:48,746 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:48,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:48,746 INFO L85 PathProgramCache]: Analyzing trace with hash -735357523, now seen corresponding path program 1 times [2025-03-08 22:51:48,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:48,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655245182] [2025-03-08 22:51:48,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:48,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:48,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 22:51:48,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 22:51:48,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:48,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:48,821 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-08 22:51:48,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:48,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655245182] [2025-03-08 22:51:48,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655245182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:48,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:48,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:51:48,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325945837] [2025-03-08 22:51:48,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:48,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:51:48,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:48,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:51:48,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:51:48,823 INFO L87 Difference]: Start difference. First operand 172 states and 198 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-08 22:51:48,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:48,891 INFO L93 Difference]: Finished difference Result 170 states and 192 transitions. [2025-03-08 22:51:48,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:51:48,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 32 [2025-03-08 22:51:48,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:48,892 INFO L225 Difference]: With dead ends: 170 [2025-03-08 22:51:48,892 INFO L226 Difference]: Without dead ends: 170 [2025-03-08 22:51:48,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:51:48,893 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 47 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:48,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 197 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:48,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-08 22:51:48,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-03-08 22:51:48,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 153 states have (on average 1.2549019607843137) internal successors, (192), 169 states have internal predecessors, (192), 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-08 22:51:48,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 192 transitions. [2025-03-08 22:51:48,896 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 192 transitions. Word has length 32 [2025-03-08 22:51:48,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:48,896 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 192 transitions. [2025-03-08 22:51:48,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-08 22:51:48,896 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 192 transitions. [2025-03-08 22:51:48,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 22:51:48,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:48,897 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:48,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 22:51:48,897 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:48,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:48,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1954222311, now seen corresponding path program 1 times [2025-03-08 22:51:48,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:48,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945476030] [2025-03-08 22:51:48,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:48,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:48,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 22:51:48,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 22:51:48,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:48,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:49,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:49,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:49,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945476030] [2025-03-08 22:51:49,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945476030] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:51:49,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893643004] [2025-03-08 22:51:49,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:49,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:49,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:51:49,375 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-08 22:51:49,378 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-08 22:51:49,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 22:51:49,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 22:51:49,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:49,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:49,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-08 22:51:49,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:51:49,554 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:51:49,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 22:51:49,598 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 11 treesize of output 7 [2025-03-08 22:51:49,613 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 15 treesize of output 11 [2025-03-08 22:51:49,711 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 27 treesize of output 15 [2025-03-08 22:51:49,719 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 23 treesize of output 11 [2025-03-08 22:51:49,816 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:51:49,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-03-08 22:51:49,958 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:51:49,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:49,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 19 [2025-03-08 22:51:49,978 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2025-03-08 22:51:49,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 19 [2025-03-08 22:51:50,182 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 11 treesize of output 7 [2025-03-08 22:51:50,186 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 22:51:50,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:50,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:51:50,385 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 8 treesize of output 4 [2025-03-08 22:51:50,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 350 treesize of output 318 [2025-03-08 22:51:50,565 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 56 treesize of output 40 [2025-03-08 22:51:50,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:50,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893643004] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:51:50,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:51:50,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 32 [2025-03-08 22:51:50,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093030184] [2025-03-08 22:51:50,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:51:50,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 22:51:50,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:50,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 22:51:50,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2025-03-08 22:51:50,696 INFO L87 Difference]: Start difference. First operand 170 states and 192 transitions. Second operand has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 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-08 22:51:51,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:51,239 INFO L93 Difference]: Finished difference Result 251 states and 279 transitions. [2025-03-08 22:51:51,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:51:51,240 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 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-08 22:51:51,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:51,240 INFO L225 Difference]: With dead ends: 251 [2025-03-08 22:51:51,241 INFO L226 Difference]: Without dead ends: 251 [2025-03-08 22:51:51,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=189, Invalid=1451, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 22:51:51,241 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 151 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:51,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1015 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:51:51,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-08 22:51:51,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 199. [2025-03-08 22:51:51,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 182 states have (on average 1.2252747252747254) internal successors, (223), 198 states have internal predecessors, (223), 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-08 22:51:51,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 223 transitions. [2025-03-08 22:51:51,245 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 223 transitions. Word has length 33 [2025-03-08 22:51:51,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:51,245 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 223 transitions. [2025-03-08 22:51:51,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 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-08 22:51:51,245 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 223 transitions. [2025-03-08 22:51:51,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 22:51:51,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:51,245 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:51,253 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-08 22:51:51,446 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,SelfDestructingSolverStorable27 [2025-03-08 22:51:51,446 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:51,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:51,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1954222919, now seen corresponding path program 1 times [2025-03-08 22:51:51,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:51,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814173967] [2025-03-08 22:51:51,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:51,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:51,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 22:51:51,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 22:51:51,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:51,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:51,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:51,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:51,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814173967] [2025-03-08 22:51:51,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814173967] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:51:51,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924326907] [2025-03-08 22:51:51,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:51,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:51,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:51:51,670 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-08 22:51:51,672 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-08 22:51:51,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 22:51:51,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 22:51:51,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:51,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:51,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 22:51:51,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:51:51,916 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-03-08 22:51:51,916 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2025-03-08 22:51:52,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:52,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 95 treesize of output 67 [2025-03-08 22:51:52,206 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 21 treesize of output 13 [2025-03-08 22:51:52,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:52,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:51:52,648 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 8 treesize of output 4 [2025-03-08 22:51:52,765 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_append_~pointerToList#1.offset| Int) (v_ArrVal_822 Int) (|v_ULTIMATE.start_append_~node~0#1.base_16| Int)) (let ((.cse0 (select (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset| |v_ULTIMATE.start_append_~node~0#1.base_16|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_16|) 0)) (= .cse0 0) (= (store (store (store |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_16| v_ArrVal_822) .cse0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)))) is different from false [2025-03-08 22:51:52,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:52,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924326907] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:51:52,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:51:52,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 10] total 24 [2025-03-08 22:51:52,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141938078] [2025-03-08 22:51:52,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:51:52,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 22:51:52,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:52,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 22:51:52,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=477, Unknown=2, NotChecked=44, Total=600 [2025-03-08 22:51:52,772 INFO L87 Difference]: Start difference. First operand 199 states and 223 transitions. Second operand has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 25 states have internal predecessors, (92), 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-08 22:51:53,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:53,517 INFO L93 Difference]: Finished difference Result 211 states and 235 transitions. [2025-03-08 22:51:53,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:51:53,520 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 25 states have internal predecessors, (92), 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-08 22:51:53,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:53,521 INFO L225 Difference]: With dead ends: 211 [2025-03-08 22:51:53,521 INFO L226 Difference]: Without dead ends: 191 [2025-03-08 22:51:53,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=781, Unknown=2, NotChecked=58, Total=992 [2025-03-08 22:51:53,522 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 27 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 6 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:53,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 572 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 527 Invalid, 4 Unknown, 77 Unchecked, 0.4s Time] [2025-03-08 22:51:53,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-08 22:51:53,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 181. [2025-03-08 22:51:53,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 164 states have (on average 1.2439024390243902) internal successors, (204), 180 states have internal predecessors, (204), 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-08 22:51:53,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 204 transitions. [2025-03-08 22:51:53,525 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 204 transitions. Word has length 33 [2025-03-08 22:51:53,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:53,526 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 204 transitions. [2025-03-08 22:51:53,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 25 states have internal predecessors, (92), 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-08 22:51:53,526 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 204 transitions. [2025-03-08 22:51:53,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 22:51:53,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:53,526 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] [2025-03-08 22:51:53,533 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-08 22:51:53,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-08 22:51:53,727 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:53,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:53,727 INFO L85 PathProgramCache]: Analyzing trace with hash 2012018817, now seen corresponding path program 1 times [2025-03-08 22:51:53,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:53,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010517923] [2025-03-08 22:51:53,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:53,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:53,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 22:51:53,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 22:51:53,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:53,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:53,962 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-08 22:51:53,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:53,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010517923] [2025-03-08 22:51:53,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010517923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:53,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:53,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 22:51:53,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343292466] [2025-03-08 22:51:53,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:53,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 22:51:53,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:53,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 22:51:53,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:51:53,964 INFO L87 Difference]: Start difference. First operand 181 states and 204 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 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-08 22:51:54,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:54,250 INFO L93 Difference]: Finished difference Result 200 states and 218 transitions. [2025-03-08 22:51:54,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:51:54,250 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 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 34 [2025-03-08 22:51:54,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:54,251 INFO L225 Difference]: With dead ends: 200 [2025-03-08 22:51:54,251 INFO L226 Difference]: Without dead ends: 200 [2025-03-08 22:51:54,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-03-08 22:51:54,252 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 136 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:54,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 316 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:51:54,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-08 22:51:54,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 183. [2025-03-08 22:51:54,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 166 states have (on average 1.2409638554216869) internal successors, (206), 182 states have internal predecessors, (206), 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-08 22:51:54,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 206 transitions. [2025-03-08 22:51:54,255 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 206 transitions. Word has length 34 [2025-03-08 22:51:54,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:54,255 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 206 transitions. [2025-03-08 22:51:54,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 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-08 22:51:54,256 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 206 transitions. [2025-03-08 22:51:54,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 22:51:54,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:54,256 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] [2025-03-08 22:51:54,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 22:51:54,256 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:54,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:54,257 INFO L85 PathProgramCache]: Analyzing trace with hash 2113689065, now seen corresponding path program 1 times [2025-03-08 22:51:54,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:54,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143876551] [2025-03-08 22:51:54,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:54,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:54,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 22:51:54,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 22:51:54,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:54,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:54,579 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-08 22:51:54,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:54,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143876551] [2025-03-08 22:51:54,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143876551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:54,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:54,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 22:51:54,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942298019] [2025-03-08 22:51:54,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:54,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 22:51:54,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:54,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 22:51:54,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-08 22:51:54,581 INFO L87 Difference]: Start difference. First operand 183 states and 206 transitions. Second operand has 16 states, 15 states have (on average 2.4) internal successors, (36), 16 states have internal predecessors, (36), 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-08 22:51:54,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:54,991 INFO L93 Difference]: Finished difference Result 194 states and 211 transitions. [2025-03-08 22:51:54,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 22:51:54,991 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 16 states have internal predecessors, (36), 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 36 [2025-03-08 22:51:54,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:54,992 INFO L225 Difference]: With dead ends: 194 [2025-03-08 22:51:54,992 INFO L226 Difference]: Without dead ends: 194 [2025-03-08 22:51:54,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2025-03-08 22:51:54,993 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 69 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:54,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 390 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:51:54,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-08 22:51:54,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 178. [2025-03-08 22:51:54,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 161 states have (on average 1.2298136645962734) internal successors, (198), 177 states have internal predecessors, (198), 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-08 22:51:54,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 198 transitions. [2025-03-08 22:51:54,996 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 198 transitions. Word has length 36 [2025-03-08 22:51:54,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:54,996 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 198 transitions. [2025-03-08 22:51:54,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 16 states have internal predecessors, (36), 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-08 22:51:54,996 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 198 transitions. [2025-03-08 22:51:54,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 22:51:54,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:54,997 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] [2025-03-08 22:51:54,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 22:51:54,997 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:54,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:54,997 INFO L85 PathProgramCache]: Analyzing trace with hash -511022676, now seen corresponding path program 1 times [2025-03-08 22:51:54,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:54,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532891301] [2025-03-08 22:51:54,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:54,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:55,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 22:51:55,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 22:51:55,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:55,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:55,265 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-08 22:51:55,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:55,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532891301] [2025-03-08 22:51:55,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532891301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:55,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:55,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 22:51:55,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815278113] [2025-03-08 22:51:55,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:55,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 22:51:55,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:55,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 22:51:55,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:51:55,267 INFO L87 Difference]: Start difference. First operand 178 states and 198 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 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-08 22:51:55,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:55,623 INFO L93 Difference]: Finished difference Result 239 states and 261 transitions. [2025-03-08 22:51:55,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 22:51:55,624 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 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 37 [2025-03-08 22:51:55,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:55,624 INFO L225 Difference]: With dead ends: 239 [2025-03-08 22:51:55,624 INFO L226 Difference]: Without dead ends: 239 [2025-03-08 22:51:55,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2025-03-08 22:51:55,625 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 94 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:55,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 523 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:51:55,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-08 22:51:55,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 181. [2025-03-08 22:51:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 164 states have (on average 1.225609756097561) internal successors, (201), 180 states have internal predecessors, (201), 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-08 22:51:55,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 201 transitions. [2025-03-08 22:51:55,630 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 201 transitions. Word has length 37 [2025-03-08 22:51:55,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:55,630 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 201 transitions. [2025-03-08 22:51:55,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 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-08 22:51:55,630 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 201 transitions. [2025-03-08 22:51:55,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 22:51:55,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:55,630 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:55,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 22:51:55,631 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:55,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:55,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1160288329, now seen corresponding path program 1 times [2025-03-08 22:51:55,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:55,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50577909] [2025-03-08 22:51:55,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:55,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:55,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 22:51:55,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 22:51:55,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:55,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:55,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:55,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:55,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50577909] [2025-03-08 22:51:55,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50577909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:55,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:55,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 22:51:55,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265885820] [2025-03-08 22:51:55,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:55,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 22:51:55,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:55,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 22:51:55,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:51:55,836 INFO L87 Difference]: Start difference. First operand 181 states and 201 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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-08 22:51:56,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:56,067 INFO L93 Difference]: Finished difference Result 199 states and 219 transitions. [2025-03-08 22:51:56,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:51:56,067 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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 38 [2025-03-08 22:51:56,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:56,068 INFO L225 Difference]: With dead ends: 199 [2025-03-08 22:51:56,068 INFO L226 Difference]: Without dead ends: 196 [2025-03-08 22:51:56,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:51:56,069 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 62 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:56,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 525 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:51:56,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-08 22:51:56,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 181. [2025-03-08 22:51:56,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 164 states have (on average 1.2134146341463414) internal successors, (199), 180 states have internal predecessors, (199), 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-08 22:51:56,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 199 transitions. [2025-03-08 22:51:56,074 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 199 transitions. Word has length 38 [2025-03-08 22:51:56,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:56,074 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 199 transitions. [2025-03-08 22:51:56,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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-08 22:51:56,074 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 199 transitions. [2025-03-08 22:51:56,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 22:51:56,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:56,076 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] [2025-03-08 22:51:56,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 22:51:56,076 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:56,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:56,076 INFO L85 PathProgramCache]: Analyzing trace with hash -264339930, now seen corresponding path program 1 times [2025-03-08 22:51:56,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:56,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656304492] [2025-03-08 22:51:56,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:56,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:56,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 22:51:56,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 22:51:56,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:56,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:56,404 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-08 22:51:56,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:56,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656304492] [2025-03-08 22:51:56,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656304492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:56,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:56,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 22:51:56,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369536180] [2025-03-08 22:51:56,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:56,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 22:51:56,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:56,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 22:51:56,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-03-08 22:51:56,405 INFO L87 Difference]: Start difference. First operand 181 states and 199 transitions. Second operand has 17 states, 16 states have (on average 2.375) internal successors, (38), 17 states have internal predecessors, (38), 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-08 22:51:56,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:56,691 INFO L93 Difference]: Finished difference Result 187 states and 200 transitions. [2025-03-08 22:51:56,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 22:51:56,698 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 17 states have internal predecessors, (38), 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 38 [2025-03-08 22:51:56,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:56,698 INFO L225 Difference]: With dead ends: 187 [2025-03-08 22:51:56,698 INFO L226 Difference]: Without dead ends: 187 [2025-03-08 22:51:56,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2025-03-08 22:51:56,699 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 127 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:56,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 314 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:51:56,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-08 22:51:56,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 181. [2025-03-08 22:51:56,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 164 states have (on average 1.2073170731707317) internal successors, (198), 180 states have internal predecessors, (198), 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-08 22:51:56,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 198 transitions. [2025-03-08 22:51:56,701 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 198 transitions. Word has length 38 [2025-03-08 22:51:56,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:56,701 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 198 transitions. [2025-03-08 22:51:56,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 17 states have internal predecessors, (38), 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-08 22:51:56,701 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 198 transitions. [2025-03-08 22:51:56,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 22:51:56,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:56,702 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] [2025-03-08 22:51:56,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 22:51:56,702 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:56,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:56,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1338166204, now seen corresponding path program 1 times [2025-03-08 22:51:56,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:56,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023182438] [2025-03-08 22:51:56,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:56,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:56,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 22:51:56,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 22:51:56,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:56,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:56,799 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-08 22:51:56,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:56,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023182438] [2025-03-08 22:51:56,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023182438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:56,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:56,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:51:56,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143321848] [2025-03-08 22:51:56,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:56,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:51:56,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:56,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:51:56,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:51:56,800 INFO L87 Difference]: Start difference. First operand 181 states and 198 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 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-08 22:51:56,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:56,870 INFO L93 Difference]: Finished difference Result 188 states and 201 transitions. [2025-03-08 22:51:56,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:51:56,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 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 38 [2025-03-08 22:51:56,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:56,871 INFO L225 Difference]: With dead ends: 188 [2025-03-08 22:51:56,871 INFO L226 Difference]: Without dead ends: 188 [2025-03-08 22:51:56,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:51:56,872 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 133 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:56,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 146 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:56,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-08 22:51:56,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 177. [2025-03-08 22:51:56,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 160 states have (on average 1.21875) internal successors, (195), 176 states have internal predecessors, (195), 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-08 22:51:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 195 transitions. [2025-03-08 22:51:56,874 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 195 transitions. Word has length 38 [2025-03-08 22:51:56,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:56,874 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 195 transitions. [2025-03-08 22:51:56,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 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-08 22:51:56,874 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 195 transitions. [2025-03-08 22:51:56,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 22:51:56,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:56,875 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:56,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 22:51:56,875 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:51:56,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:56,875 INFO L85 PathProgramCache]: Analyzing trace with hash -200996672, now seen corresponding path program 3 times [2025-03-08 22:51:56,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:56,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803864532] [2025-03-08 22:51:56,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:51:56,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:56,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 6 equivalence classes. [2025-03-08 22:51:56,914 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 22:51:56,918 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 22:51:56,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:57,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:57,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803864532] [2025-03-08 22:51:57,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803864532] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:51:57,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385005856] [2025-03-08 22:51:57,639 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:51:57,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:57,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:51:57,640 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-08 22:51:57,641 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-08 22:51:57,718 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 6 equivalence classes. [2025-03-08 22:51:57,860 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 22:51:57,860 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 22:51:57,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:57,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-08 22:51:57,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:51:57,879 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-08 22:51:57,883 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-08 22:51:57,899 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 22:51:57,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-08 22:51:57,911 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:51:57,911 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-08 22:51:57,934 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 15 treesize of output 1 [2025-03-08 22:51:57,935 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 11 treesize of output 7 [2025-03-08 22:51:58,048 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 22:51:58,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 39 [2025-03-08 22:51:58,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:51:58,052 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 24 treesize of output 11 [2025-03-08 22:51:58,146 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 22:51:58,146 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 39 [2025-03-08 22:51:58,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:51:58,152 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 24 treesize of output 11 [2025-03-08 22:51:58,249 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 22:51:58,249 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 39 [2025-03-08 22:51:58,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:51:58,255 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 24 treesize of output 11 [2025-03-08 22:51:58,353 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 22:51:58,353 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 39 [2025-03-08 22:51:58,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:51:58,361 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 24 treesize of output 11 [2025-03-08 22:51:58,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:51:58,464 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 18 treesize of output 13 [2025-03-08 22:51:58,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:51:58,467 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 16 treesize of output 11 [2025-03-08 22:51:58,542 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 17 treesize of output 9 [2025-03-08 22:51:58,545 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 7 treesize of output 3 [2025-03-08 22:51:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:58,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:52:04,712 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (and (forall ((v_ArrVal_1167 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_1167))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (forall ((v_ArrVal_1168 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_1168))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (< (select |c_#length| .cse0) (+ .cse1 .cse2 8)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_subst_1 Int)) (let ((.cse3 (store .cse6 .cse0 v_ArrVal_1170))) (or (< (select |c_#length| v_subst_1) (+ .cse2 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) 12)) (forall ((v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= (+ (select (select (store .cse3 v_subst_1 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) .cse2 16) (select |c_#length| (select (select (store (store .cse5 .cse0 v_ArrVal_1169) v_subst_1 v_ArrVal_1171) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))))))))))) (< (+ .cse1 .cse2 4) 0))))) (forall ((v_ArrVal_1167 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_1167))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (forall ((v_ArrVal_1168 (Array Int Int))) (let ((.cse8 (select (select (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_1168) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (< (select |c_#length| .cse8) (+ .cse9 .cse2 8)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_subst_2 Int)) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_1170))) (or (forall ((v_ArrVal_1172 (Array Int Int))) (<= 0 (+ (select (select (store .cse10 v_subst_2 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) .cse2 12))) (< (select |c_#length| v_subst_2) (+ .cse2 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) 12)))))))) (< (+ .cse9 .cse2 4) 0)))))))) is different from false [2025-03-08 22:52:04,863 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1167 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_1167))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (or (forall ((v_ArrVal_1168 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_1168))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_subst_1 Int)) (let ((.cse0 (store .cse5 .cse4 v_ArrVal_1170))) (or (forall ((v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= (+ (select (select (store .cse0 v_subst_1 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 20) (select |c_#length| (select (select (store (store .cse3 .cse4 v_ArrVal_1169) v_subst_1 v_ArrVal_1171) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (< (select |c_#length| v_subst_1) (+ .cse2 16 (select (select .cse0 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (< (select |c_#length| .cse4) (+ .cse6 .cse2 12)))))) (< (+ .cse6 .cse2 8) 0))))) (forall ((v_ArrVal_1167 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_1167))) (let ((.cse11 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (or (forall ((v_ArrVal_1168 (Array Int Int))) (let ((.cse10 (select (select (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_1168) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_subst_2 Int)) (let ((.cse8 (store .cse9 .cse10 v_ArrVal_1170))) (or (< (select |c_#length| v_subst_2) (+ .cse2 16 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (forall ((v_ArrVal_1172 (Array Int Int))) (<= 0 (+ (select (select (store .cse8 v_subst_2 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 16)))))) (< (select |c_#length| .cse10) (+ .cse11 .cse2 12))))) (< (+ .cse11 .cse2 8) 0)))))))) is different from false [2025-03-08 22:52:04,973 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse4 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1165))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse5 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1166) .cse7 v_ArrVal_1167))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (< (+ .cse0 8 .cse1) 0) (forall ((v_ArrVal_1168 (Array Int Int))) (let ((.cse2 (select (select (store .cse6 .cse7 v_ArrVal_1168) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (< (select |c_#length| .cse2) (+ .cse0 12 .cse1)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_subst_2 Int)) (let ((.cse3 (store .cse5 .cse2 v_ArrVal_1170))) (or (forall ((v_ArrVal_1172 (Array Int Int))) (<= 0 (+ .cse0 16 (select (select (store .cse3 v_subst_2 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))) (< (select |c_#length| v_subst_2) (+ .cse0 16 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))))))))))))))) (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1165))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse12 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1166) .cse14 v_ArrVal_1167))) (let ((.cse8 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (< (+ .cse0 8 .cse8) 0) (forall ((v_ArrVal_1168 (Array Int Int))) (let ((.cse11 (store .cse13 .cse14 v_ArrVal_1168))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (< (select |c_#length| .cse9) (+ .cse0 12 .cse8)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_subst_1 Int)) (let ((.cse10 (store .cse12 .cse9 v_ArrVal_1170))) (or (< (select |c_#length| v_subst_1) (+ .cse0 16 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (forall ((v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= (+ (select (select (store .cse10 v_subst_1 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) .cse0 20) (select |c_#length| (select (select (store (store .cse11 .cse9 v_ArrVal_1169) v_subst_1 v_ArrVal_1171) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))))))))))))))))))) is different from false [2025-03-08 22:52:05,696 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (and (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_1165))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_1166) .cse8 v_ArrVal_1167))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (< (+ .cse0 .cse1 12) 0) (forall ((v_ArrVal_1168 (Array Int Int))) (let ((.cse5 (store .cse7 .cse8 v_ArrVal_1168))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (< (select |c_#length| .cse2) (+ .cse0 16 .cse1)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_subst_1 Int)) (let ((.cse3 (store .cse6 .cse2 v_ArrVal_1170))) (or (< (select |c_#length| v_subst_1) (+ .cse0 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) 20)) (forall ((v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= (+ .cse0 (select (select (store .cse3 v_subst_1 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) 24) (select |c_#length| (select (select (store (store .cse5 .cse2 v_ArrVal_1169) v_subst_1 v_ArrVal_1171) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))))))))))))))))) (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_1165))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse11 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_1166) .cse15 v_ArrVal_1167))) (let ((.cse13 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (forall ((v_ArrVal_1168 (Array Int Int))) (let ((.cse12 (select (select (store .cse14 .cse15 v_ArrVal_1168) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_subst_2 Int)) (let ((.cse10 (store .cse11 .cse12 v_ArrVal_1170))) (or (forall ((v_ArrVal_1172 (Array Int Int))) (<= 0 (+ (select (select (store .cse10 v_subst_2 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) .cse0 20))) (< (select |c_#length| v_subst_2) (+ .cse0 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) 20))))) (< (select |c_#length| .cse12) (+ .cse0 16 .cse13))))) (< (+ .cse0 .cse13 12) 0)))))))))) is different from false [2025-03-08 22:52:05,804 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse4 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1164))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse6 (store .cse9 .cse8 v_ArrVal_1165))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse5 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1163) .cse8 v_ArrVal_1166) .cse7 v_ArrVal_1167))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (< (+ .cse0 12 .cse1) 0) (forall ((v_ArrVal_1168 (Array Int Int))) (let ((.cse2 (select (select (store .cse6 .cse7 v_ArrVal_1168) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (< (select |c_#length| .cse2) (+ .cse0 16 .cse1)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_subst_2 Int)) (let ((.cse3 (store .cse5 .cse2 v_ArrVal_1170))) (or (< (select |c_#length| v_subst_2) (+ .cse0 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) 20)) (forall ((v_ArrVal_1172 (Array Int Int))) (<= 0 (+ (select (select (store .cse3 v_subst_2 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) .cse0 20))))))))))))))))) (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1164))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse15 (store .cse18 .cse17 v_ArrVal_1165))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse14 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1163) .cse17 v_ArrVal_1166) .cse16 v_ArrVal_1167))) (let ((.cse10 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (< (+ .cse0 12 .cse10) 0) (forall ((v_ArrVal_1168 (Array Int Int))) (let ((.cse13 (store .cse15 .cse16 v_ArrVal_1168))) (let ((.cse11 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (< (select |c_#length| .cse11) (+ .cse0 16 .cse10)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_subst_1 Int)) (let ((.cse12 (store .cse14 .cse11 v_ArrVal_1170))) (or (< (select |c_#length| v_subst_1) (+ .cse0 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) 20)) (forall ((v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= (+ .cse0 (select (select (store .cse12 v_subst_1 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) 24) (select |c_#length| (select (select (store (store .cse13 .cse11 v_ArrVal_1169) v_subst_1 v_ArrVal_1171) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))))))))))))))))))))) is different from false [2025-03-08 22:52:06,014 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (and (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse8 v_ArrVal_1164))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse6 (store .cse10 .cse9 v_ArrVal_1165))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse5 (store (store (store |c_#memory_$Pointer$#1.offset| .cse8 v_ArrVal_1163) .cse9 v_ArrVal_1166) .cse7 v_ArrVal_1167))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (< (+ .cse0 .cse1 12) 0) (forall ((v_ArrVal_1168 (Array Int Int))) (let ((.cse2 (select (select (store .cse6 .cse7 v_ArrVal_1168) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (< (select |c_#length| .cse2) (+ .cse0 .cse1 16)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_subst_2 Int)) (let ((.cse3 (store .cse5 .cse2 v_ArrVal_1170))) (or (< (select |c_#length| v_subst_2) (+ .cse1 20 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (forall ((v_ArrVal_1172 (Array Int Int))) (<= 0 (+ (select (select (store .cse3 v_subst_2 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) .cse1 20))))))))))))))))) (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| .cse8 v_ArrVal_1164))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse16 (store .cse19 .cse18 v_ArrVal_1165))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse15 (store (store (store |c_#memory_$Pointer$#1.offset| .cse8 v_ArrVal_1163) .cse18 v_ArrVal_1166) .cse17 v_ArrVal_1167))) (let ((.cse11 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (< (+ .cse11 .cse1 12) 0) (forall ((v_ArrVal_1168 (Array Int Int))) (let ((.cse13 (store .cse16 .cse17 v_ArrVal_1168))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_subst_1 Int)) (let ((.cse12 (store .cse15 .cse14 v_ArrVal_1170))) (or (forall ((v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= (+ (select (select (store .cse12 v_subst_1 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) .cse1 24) (select |c_#length| (select (select (store (store .cse13 .cse14 v_ArrVal_1169) v_subst_1 v_ArrVal_1171) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))) (< (select |c_#length| v_subst_1) (+ .cse1 20 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))))) (< (select |c_#length| .cse14) (+ .cse11 .cse1 16))))))))))))))))) is different from false [2025-03-08 22:52:06,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:06,893 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 629 treesize of output 599 [2025-03-08 22:52:06,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:06,910 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 589 treesize of output 359 [2025-03-08 22:52:06,931 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 14607 treesize of output 12687 [2025-03-08 22:52:07,010 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 231385 treesize of output 228967 [2025-03-08 22:52:07,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 281 treesize of output 273 [2025-03-08 22:52:07,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 358 treesize of output 330 [2025-03-08 22:52:07,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 397 treesize of output 381 [2025-03-08 22:52:07,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 381 treesize of output 345 [2025-03-08 22:52:07,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 345 treesize of output 329 [2025-03-08 22:52:07,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 172 treesize of output 152 [2025-03-08 22:52:07,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 313 treesize of output 277 [2025-03-08 22:52:07,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 277 treesize of output 261 [2025-03-08 22:52:07,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:07,739 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 807 treesize of output 777 [2025-03-08 22:52:07,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:07,767 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 767 treesize of output 457 [2025-03-08 22:52:07,902 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 12856912 treesize of output 11427928 [2025-03-08 22:52:08,416 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 1504059 treesize of output 1491423 [2025-03-08 22:52:08,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 742 treesize of output 718 [2025-03-08 22:52:08,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 718 treesize of output 666 [2025-03-08 22:52:08,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 666 treesize of output 614 [2025-03-08 22:52:08,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 948 treesize of output 904 [2025-03-08 22:52:08,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1183 treesize of output 1111 [2025-03-08 22:52:08,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1178 treesize of output 1134 [2025-03-08 22:52:08,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1134 treesize of output 1002 [2025-03-08 22:52:08,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1002 treesize of output 970 [2025-03-08 22:52:08,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 970 treesize of output 858 [2025-03-08 22:52:08,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 680 treesize of output 664 [2025-03-08 22:52:10,898 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 24 refuted. 3 times theorem prover too weak. 0 trivial. 43 not checked. [2025-03-08 22:52:10,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385005856] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:52:10,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:52:10,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 21] total 52 [2025-03-08 22:52:10,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049796492] [2025-03-08 22:52:10,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:52:10,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-08 22:52:10,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:52:10,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-08 22:52:10,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1851, Unknown=32, NotChecked=570, Total=2756 [2025-03-08 22:52:10,900 INFO L87 Difference]: Start difference. First operand 177 states and 195 transitions. Second operand has 53 states, 52 states have (on average 2.0) internal successors, (104), 53 states have internal predecessors, (104), 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-08 22:52:27,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:52:31,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:52:35,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:52:40,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:52:44,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:52:48,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:52:52,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:52:53,219 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (let ((.cse14 (select |c_#length| .cse7)) (.cse17 (+ .cse12 .cse2 8)) (.cse13 (+ .cse12 .cse2 4))) (and (forall ((v_ArrVal_1167 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_1167))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (or (forall ((v_ArrVal_1168 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_1168))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_subst_1 Int)) (let ((.cse0 (store .cse5 .cse4 v_ArrVal_1170))) (or (forall ((v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= (+ (select (select (store .cse0 v_subst_1 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 20) (select |c_#length| (select (select (store (store .cse3 .cse4 v_ArrVal_1169) v_subst_1 v_ArrVal_1171) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (< (select |c_#length| v_subst_1) (+ .cse2 16 (select (select .cse0 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (< (select |c_#length| .cse4) (+ .cse6 .cse2 12)))))) (< (+ .cse6 .cse2 8) 0))))) (forall ((v_ArrVal_1167 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_1167))) (let ((.cse11 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (or (forall ((v_ArrVal_1168 (Array Int Int))) (let ((.cse10 (select (select (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_1168) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_subst_2 Int)) (let ((.cse8 (store .cse9 .cse10 v_ArrVal_1170))) (or (< (select |c_#length| v_subst_2) (+ .cse2 16 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (forall ((v_ArrVal_1172 (Array Int Int))) (<= 0 (+ (select (select (store .cse8 v_subst_2 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 16)))))) (< (select |c_#length| .cse10) (+ .cse11 .cse2 12))))) (< (+ .cse11 .cse2 8) 0))))) (<= 0 (+ .cse12 .cse2)) (<= .cse13 .cse14) (or (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_subst_2 Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_1170))) (or (forall ((v_ArrVal_1172 (Array Int Int))) (<= 0 (+ .cse2 (select (select (store .cse15 v_subst_2 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 12))) (< (select |c_#length| v_subst_2) (+ (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 12))))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_subst_1 Int)) (let ((.cse16 (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_1170))) (or (forall ((v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= (+ .cse2 16 (select (select (store .cse16 v_subst_1 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_1169) v_subst_1 v_ArrVal_1171) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (< (select |c_#length| v_subst_1) (+ (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 12)))))) (< .cse14 .cse17) (< .cse13 0)) (<= .cse17 .cse14) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= (+ .cse2 12 (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1171) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse17))) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse17) (forall ((v_ArrVal_1172 (Array Int Int))) (<= 0 (+ .cse2 8 (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_create_data_~data~0#1.base|) 1) (<= 0 .cse13) (<= (select |c_#length| |c_ULTIMATE.start_create_data_~data~0#1.base|) 8) (= |c_ULTIMATE.start_create_data_~data~0#1.offset| 0))))) is different from false [2025-03-08 22:52:53,258 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse17 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse3 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (let ((.cse0 (+ .cse17 .cse3)) (.cse6 (select |c_#length| .cse4)) (.cse7 (+ .cse17 .cse3 4))) (and (or (< .cse0 0) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_subst_2 Int)) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1170))) (or (< (select |c_#length| v_subst_2) (+ (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 8)) (forall ((v_ArrVal_1172 (Array Int Int))) (<= 0 (+ .cse3 (select (select (store .cse1 v_subst_2 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8)))))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_subst_1 Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1170))) (or (< (select |c_#length| v_subst_1) (+ (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 8)) (forall ((v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= (+ .cse3 12 (select (select (store .cse5 v_subst_1 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_1169) v_subst_1 v_ArrVal_1171) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))) (< .cse6 .cse7)) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= (+ .cse3 8 (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1171) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse7))) (<= 0 .cse0) (<= .cse7 .cse6) (forall ((v_ArrVal_1167 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1167))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (forall ((v_ArrVal_1168 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_1168))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< (select |c_#length| .cse8) (+ .cse9 .cse3 8)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_subst_1 Int)) (let ((.cse10 (store .cse12 .cse8 v_ArrVal_1170))) (or (< (select |c_#length| v_subst_1) (+ .cse3 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12)) (forall ((v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= (+ (select (select (store .cse10 v_subst_1 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 16) (select |c_#length| (select (select (store (store .cse11 .cse8 v_ArrVal_1169) v_subst_1 v_ArrVal_1171) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))))))) (< (+ .cse9 .cse3 4) 0))))) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1172 (Array Int Int))) (<= 0 (+ .cse3 4 (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse7))) (forall ((v_ArrVal_1167 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1167))) (let ((.cse14 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (forall ((v_ArrVal_1168 (Array Int Int))) (let ((.cse13 (select (select (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_1168) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< (select |c_#length| .cse13) (+ .cse14 .cse3 8)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_subst_2 Int)) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_1170))) (or (forall ((v_ArrVal_1172 (Array Int Int))) (<= 0 (+ (select (select (store .cse15 v_subst_2 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 12))) (< (select |c_#length| v_subst_2) (+ .cse3 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12)))))))) (< (+ .cse14 .cse3 4) 0))))))))) is different from false [2025-03-08 22:52:53,533 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (let ((.cse2 (+ .cse4 |c_ULTIMATE.start_create_data_#t~mem7#1.offset|)) (.cse1 (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem7#1.base|)) (.cse0 (+ .cse4 |c_ULTIMATE.start_create_data_#t~mem7#1.offset| 4)) (.cse7 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (<= .cse0 .cse1) (<= 0 .cse2) (forall ((v_ArrVal_1167 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1167))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (or (forall ((v_ArrVal_1168 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1168))) (let ((.cse3 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (or (< (select |c_#length| .cse3) (+ .cse4 8 .cse5)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_subst_1 Int)) (let ((.cse6 (store .cse9 .cse3 v_ArrVal_1170))) (or (< (select |c_#length| v_subst_1) (+ .cse4 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7) 12)) (forall ((v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= (+ (select (select (store .cse6 v_subst_1 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7) .cse4 16) (select |c_#length| (select (select (store (store .cse8 .cse3 v_ArrVal_1169) v_subst_1 v_ArrVal_1171) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))))))))))) (< (+ .cse4 .cse5 4) 0))))) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= (+ .cse4 8 (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1171) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7)))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse0))) (or (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_subst_2 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1170))) (or (forall ((v_ArrVal_1172 (Array Int Int))) (<= 0 (+ (select (select (store .cse10 v_subst_2 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7) .cse4 8))) (< (select |c_#length| v_subst_2) (+ (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7) .cse4 8))))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_subst_1 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1170))) (or (< (select |c_#length| v_subst_1) (+ (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7) .cse4 8)) (forall ((v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= (+ (select (select (store .cse11 v_subst_1 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7) .cse4 12) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1169) v_subst_1 v_ArrVal_1171) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7)))))))) (< .cse2 0) (< .cse1 .cse0)) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1172 (Array Int Int))) (<= 0 (+ .cse4 4 (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7)))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse0))) (forall ((v_ArrVal_1167 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1167))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (or (< (+ .cse4 .cse12 4) 0) (forall ((v_ArrVal_1168 (Array Int Int))) (let ((.cse13 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1168) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (or (< (select |c_#length| .cse13) (+ .cse4 8 .cse12)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_subst_2 Int)) (let ((.cse14 (store .cse15 .cse13 v_ArrVal_1170))) (or (forall ((v_ArrVal_1172 (Array Int Int))) (<= 0 (+ .cse4 12 (select (select (store .cse14 v_subst_2 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7)))) (< (select |c_#length| v_subst_2) (+ .cse4 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7) 12))))))))))))))) is different from false [2025-03-08 22:52:58,339 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse5 (select |c_#length| .cse3)) (.cse6 (+ .cse8 .cse0 8)) (.cse7 (+ .cse8 .cse0 4))) (and (or (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_subst_2 Int)) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1170))) (or (forall ((v_ArrVal_1172 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store .cse1 v_subst_2 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12))) (< (select |c_#length| v_subst_2) (+ (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse0 12))))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_subst_1 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1170))) (or (forall ((v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= (+ .cse0 16 (select (select (store .cse4 v_subst_1 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1169) v_subst_1 v_ArrVal_1171) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (< (select |c_#length| v_subst_1) (+ (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse0 12)))))) (< .cse5 .cse6) (< .cse7 0)) (<= .cse6 .cse5) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= (+ .cse0 12 (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1171) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse6))) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse6) (forall ((v_ArrVal_1172 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (<= 0 .cse7))))) is different from false [2025-03-08 22:52:58,413 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse8 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse3 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (let ((.cse0 (+ .cse8 .cse3)) (.cse6 (select |c_#length| .cse4)) (.cse7 (+ .cse8 .cse3 4))) (and (or (< .cse0 0) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_subst_2 Int)) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1170))) (or (< (select |c_#length| v_subst_2) (+ (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 8)) (forall ((v_ArrVal_1172 (Array Int Int))) (<= 0 (+ .cse3 (select (select (store .cse1 v_subst_2 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8)))))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_subst_1 Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1170))) (or (< (select |c_#length| v_subst_1) (+ (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 8)) (forall ((v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= (+ .cse3 12 (select (select (store .cse5 v_subst_1 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_1169) v_subst_1 v_ArrVal_1171) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))) (< .cse6 .cse7)) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= (+ .cse3 8 (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1171) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse7))) (<= 0 .cse0) (<= .cse7 .cse6) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1172 (Array Int Int))) (<= 0 (+ .cse3 4 (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse7))))))) is different from false [2025-03-08 22:52:58,666 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (let ((.cse2 (+ .cse3 |c_ULTIMATE.start_create_data_#t~mem7#1.offset|)) (.cse1 (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem7#1.base|)) (.cse4 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4)) (.cse0 (+ .cse3 |c_ULTIMATE.start_create_data_#t~mem7#1.offset| 4))) (and (<= .cse0 .cse1) (<= 0 .cse2) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= (+ .cse3 8 (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1171) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse0))) (or (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_subst_2 Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1170))) (or (forall ((v_ArrVal_1172 (Array Int Int))) (<= 0 (+ (select (select (store .cse5 v_subst_2 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) .cse3 8))) (< (select |c_#length| v_subst_2) (+ (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) .cse3 8))))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_subst_1 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1170))) (or (< (select |c_#length| v_subst_1) (+ (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) .cse3 8)) (forall ((v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= (+ (select (select (store .cse6 v_subst_1 v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) .cse3 12) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1169) v_subst_1 v_ArrVal_1171) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))))))) (< .cse2 0) (< .cse1 .cse0)) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1172 (Array Int Int))) (<= 0 (+ .cse3 4 (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse0)))))) is different from false [2025-03-08 22:52:58,710 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (let ((.cse0 (+ .cse3 .cse2 8))) (and (<= .cse0 (select |c_#length| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= (+ .cse2 12 (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1171) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse0))) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse0) (forall ((v_ArrVal_1172 (Array Int Int))) (<= 0 (+ .cse2 8 (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (<= 0 (+ .cse3 .cse2 4)))))) is different from false [2025-03-08 22:53:00,780 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (let ((.cse2 (+ .cse3 .cse0 4)) (.cse4 (+ .cse0 |c_ULTIMATE.start_create_data_#t~mem7#1.offset| 4))) (and (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1171) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse2))) (<= 0 (+ .cse3 .cse0)) (<= .cse4 (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem7#1.base|)) (<= 0 (+ .cse0 |c_ULTIMATE.start_create_data_#t~mem7#1.offset|)) (<= .cse2 (select |c_#length| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1172 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse2))) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1171) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse4))) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1172 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse4))))))) is different from false [2025-03-08 22:53:00,809 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4)) (.cse0 (+ .cse1 |c_ULTIMATE.start_create_data_#t~mem7#1.offset| 4))) (and (<= .cse0 (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem7#1.base|)) (<= 0 (+ .cse1 |c_ULTIMATE.start_create_data_#t~mem7#1.offset|)) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= (+ .cse1 8 (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1171) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse0))) (forall ((|ULTIMATE.start_create_data_#t~mem7#1.base| Int)) (or (forall ((v_ArrVal_1172 (Array Int Int))) (<= 0 (+ .cse1 4 (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_1172) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (< (select |c_#length| |ULTIMATE.start_create_data_#t~mem7#1.base|) .cse0)))))) is different from false [2025-03-08 22:53:01,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:01,806 INFO L93 Difference]: Finished difference Result 207 states and 227 transitions. [2025-03-08 22:53:01,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 22:53:01,807 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.0) internal successors, (104), 53 states have internal predecessors, (104), 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 39 [2025-03-08 22:53:01,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:01,808 INFO L225 Difference]: With dead ends: 207 [2025-03-08 22:53:01,808 INFO L226 Difference]: Without dead ends: 207 [2025-03-08 22:53:01,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 78 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 1187 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=701, Invalid=3449, Unknown=70, NotChecked=2100, Total=6320 [2025-03-08 22:53:01,809 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 153 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 29 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 2391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 1196 IncrementalHoareTripleChecker+Unchecked, 34.7s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:01,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1274 Invalid, 2391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1135 Invalid, 31 Unknown, 1196 Unchecked, 34.7s Time] [2025-03-08 22:53:01,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-08 22:53:01,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2025-03-08 22:53:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 190 states have (on average 1.194736842105263) internal successors, (227), 206 states have internal predecessors, (227), 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-08 22:53:01,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 227 transitions. [2025-03-08 22:53:01,813 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 227 transitions. Word has length 39 [2025-03-08 22:53:01,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:01,814 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 227 transitions. [2025-03-08 22:53:01,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.0) internal successors, (104), 53 states have internal predecessors, (104), 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-08 22:53:01,814 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 227 transitions. [2025-03-08 22:53:01,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 22:53:01,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:01,815 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] [2025-03-08 22:53:01,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 22:53:02,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:02,015 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:53:02,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:02,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2019149287, now seen corresponding path program 1 times [2025-03-08 22:53:02,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:53:02,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599097893] [2025-03-08 22:53:02,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:02,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:53:02,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 22:53:02,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 22:53:02,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:02,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:06,079 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-08 22:53:06,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:53:06,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599097893] [2025-03-08 22:53:06,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599097893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:06,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:06,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 22:53:06,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364715862] [2025-03-08 22:53:06,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:06,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 22:53:06,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:53:06,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 22:53:06,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:53:06,081 INFO L87 Difference]: Start difference. First operand 207 states and 227 transitions. Second operand has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 20 states have internal predecessors, (41), 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)