./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.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-2.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 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:51:41,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:51:41,089 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:41,094 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:51:41,095 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:51:41,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:51:41,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:51:41,115 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:51:41,116 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:51:41,116 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:51:41,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:51:41,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:51:41,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:51:41,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:51:41,117 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:51:41,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:51:41,118 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:51:41,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:51:41,118 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:51:41,118 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:51:41,118 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:51:41,118 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:51:41,118 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:51:41,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:51:41,118 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:51:41,118 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:51:41,119 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:51:41,119 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:51:41,119 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:51:41,119 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:51:41,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:51:41,119 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:51:41,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:51:41,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:51:41,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:51:41,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:51:41,120 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:51:41,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:51:41,120 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:51:41,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:51:41,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:51:41,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:51:41,120 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 -> 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 [2025-03-08 22:51:41,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:51:41,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:51:41,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:51:41,368 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:51:41,369 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:51:41,370 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-2.i [2025-03-08 22:51:42,498 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07b5ddafc/f578308f8b2a4223a69a0558732d305d/FLAGc5301ec76 [2025-03-08 22:51:42,771 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:51:42,772 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2025-03-08 22:51:42,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07b5ddafc/f578308f8b2a4223a69a0558732d305d/FLAGc5301ec76 [2025-03-08 22:51:42,805 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07b5ddafc/f578308f8b2a4223a69a0558732d305d [2025-03-08 22:51:42,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:51:42,808 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:51:42,809 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:51:42,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:51:42,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:51:42,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:51:42" (1/1) ... [2025-03-08 22:51:42,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56fc561c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:42, skipping insertion in model container [2025-03-08 22:51:42,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:51:42" (1/1) ... [2025-03-08 22:51:42,842 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:51:42,994 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:43,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:51:43,021 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:51:43,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:51:43,090 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:51:43,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:43 WrapperNode [2025-03-08 22:51:43,090 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:51:43,091 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:51:43,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:51:43,091 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:51:43,095 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:43" (1/1) ... [2025-03-08 22:51:43,103 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:43" (1/1) ... [2025-03-08 22:51:43,121 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 115 [2025-03-08 22:51:43,121 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:51:43,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:51:43,122 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:51:43,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:51:43,129 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:43" (1/1) ... [2025-03-08 22:51:43,129 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:43" (1/1) ... [2025-03-08 22:51:43,138 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:43" (1/1) ... [2025-03-08 22:51:43,151 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 8, 11]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 8 writes are split as follows [0, 2, 6]. [2025-03-08 22:51:43,151 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:43" (1/1) ... [2025-03-08 22:51:43,151 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:43" (1/1) ... [2025-03-08 22:51:43,156 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:43" (1/1) ... [2025-03-08 22:51:43,157 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:43" (1/1) ... [2025-03-08 22:51:43,158 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:43" (1/1) ... [2025-03-08 22:51:43,158 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:43" (1/1) ... [2025-03-08 22:51:43,160 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:51:43,161 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:51:43,161 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:51:43,161 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:51:43,161 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:43" (1/1) ... [2025-03-08 22:51:43,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:51:43,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:51:43,190 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:43,193 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:43,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:51:43,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 22:51:43,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 22:51:43,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:51:43,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:51:43,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:51:43,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 22:51:43,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 22:51:43,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 22:51:43,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:51:43,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:51:43,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 22:51:43,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:51:43,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 22:51:43,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 22:51:43,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 22:51:43,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:51:43,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:51:43,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 22:51:43,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:51:43,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:51:43,291 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:51:43,292 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:51:43,591 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:43,613 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-03-08 22:51:43,614 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:51:43,621 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:51:43,622 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:51:43,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:51:43 BoogieIcfgContainer [2025-03-08 22:51:43,623 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:51:43,624 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:51:43,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:51:43,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:51:43,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:51:42" (1/3) ... [2025-03-08 22:51:43,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761a8a89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:51:43, skipping insertion in model container [2025-03-08 22:51:43,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:43" (2/3) ... [2025-03-08 22:51:43,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761a8a89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:51:43, skipping insertion in model container [2025-03-08 22:51:43,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:51:43" (3/3) ... [2025-03-08 22:51:43,629 INFO L128 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-2.i [2025-03-08 22:51:43,639 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:51:43,641 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG optional_data_creation_test04-2.i that has 1 procedures, 100 locations, 1 initial locations, 3 loop locations, and 46 error locations. [2025-03-08 22:51:43,679 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:51:43,689 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;@4c56d517, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:51:43,690 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-03-08 22:51:43,694 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:43,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 22:51:43,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:43,699 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 22:51:43,699 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:43,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:43,704 INFO L85 PathProgramCache]: Analyzing trace with hash 4401054, now seen corresponding path program 1 times [2025-03-08 22:51:43,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:43,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832103901] [2025-03-08 22:51:43,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:43,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:43,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 22:51:43,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 22:51:43,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:43,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:43,926 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,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:43,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832103901] [2025-03-08 22:51:43,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832103901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:43,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:43,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:51:43,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224286029] [2025-03-08 22:51:43,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:43,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:51:43,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:43,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:51:43,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:51:43,954 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:44,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:44,107 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2025-03-08 22:51:44,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:51:44,109 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:44,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:44,113 INFO L225 Difference]: With dead ends: 103 [2025-03-08 22:51:44,113 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 22:51:44,114 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:44,116 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:44,116 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:44,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 22:51:44,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2025-03-08 22:51:44,135 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:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2025-03-08 22:51:44,138 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 4 [2025-03-08 22:51:44,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:44,138 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2025-03-08 22:51:44,139 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:44,139 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2025-03-08 22:51:44,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 22:51:44,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:44,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 22:51:44,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:51:44,139 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:44,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:44,140 INFO L85 PathProgramCache]: Analyzing trace with hash 4401055, now seen corresponding path program 1 times [2025-03-08 22:51:44,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:44,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161774198] [2025-03-08 22:51:44,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:44,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:44,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 22:51:44,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 22:51:44,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:44,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:44,277 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:44,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:44,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161774198] [2025-03-08 22:51:44,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161774198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:44,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:44,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:51:44,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254555868] [2025-03-08 22:51:44,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:44,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:51:44,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:44,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:51:44,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:51:44,279 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:44,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:44,434 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2025-03-08 22:51:44,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:51:44,435 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:44,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:44,436 INFO L225 Difference]: With dead ends: 134 [2025-03-08 22:51:44,437 INFO L226 Difference]: Without dead ends: 134 [2025-03-08 22:51:44,437 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:44,438 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:44,438 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:44,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-08 22:51:44,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 104. [2025-03-08 22:51:44,446 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:44,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2025-03-08 22:51:44,448 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 4 [2025-03-08 22:51:44,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:44,448 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2025-03-08 22:51:44,448 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:44,448 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2025-03-08 22:51:44,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 22:51:44,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:44,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 22:51:44,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:51:44,449 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:44,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:44,450 INFO L85 PathProgramCache]: Analyzing trace with hash 136432748, now seen corresponding path program 1 times [2025-03-08 22:51:44,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:44,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151380363] [2025-03-08 22:51:44,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:44,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:44,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 22:51:44,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 22:51:44,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:44,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:44,494 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:44,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:44,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151380363] [2025-03-08 22:51:44,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151380363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:44,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:44,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:51:44,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73834171] [2025-03-08 22:51:44,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:44,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:51:44,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:44,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:51:44,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:51:44,498 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:44,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:44,557 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2025-03-08 22:51:44,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:51:44,559 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:44,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:44,559 INFO L225 Difference]: With dead ends: 102 [2025-03-08 22:51:44,559 INFO L226 Difference]: Without dead ends: 102 [2025-03-08 22:51:44,560 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:44,560 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:44,560 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:44,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-08 22:51:44,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-08 22:51:44,569 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:44,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2025-03-08 22:51:44,569 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 5 [2025-03-08 22:51:44,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:44,569 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2025-03-08 22:51:44,570 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:44,570 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2025-03-08 22:51:44,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 22:51:44,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:44,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 22:51:44,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:51:44,570 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:44,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:44,570 INFO L85 PathProgramCache]: Analyzing trace with hash 136432749, now seen corresponding path program 1 times [2025-03-08 22:51:44,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:44,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951652833] [2025-03-08 22:51:44,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:44,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:44,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 22:51:44,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 22:51:44,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:44,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:44,640 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:44,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:44,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951652833] [2025-03-08 22:51:44,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951652833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:44,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:44,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:51:44,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817360054] [2025-03-08 22:51:44,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:44,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:51:44,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:44,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:51:44,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:51:44,642 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:44,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:44,688 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2025-03-08 22:51:44,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:51:44,688 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:44,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:44,691 INFO L225 Difference]: With dead ends: 100 [2025-03-08 22:51:44,691 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 22:51:44,691 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:44,693 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:44,693 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:44,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 22:51:44,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-08 22:51:44,699 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:44,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2025-03-08 22:51:44,700 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 5 [2025-03-08 22:51:44,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:44,700 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2025-03-08 22:51:44,700 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:44,700 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2025-03-08 22:51:44,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 22:51:44,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:44,700 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:44,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:51:44,700 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:44,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:44,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1349516329, now seen corresponding path program 1 times [2025-03-08 22:51:44,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:44,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728399134] [2025-03-08 22:51:44,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:44,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:44,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 22:51:44,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 22:51:44,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:44,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:44,770 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:44,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:44,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728399134] [2025-03-08 22:51:44,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728399134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:44,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:44,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:51:44,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532729493] [2025-03-08 22:51:44,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:44,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:51:44,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:44,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:51:44,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:51:44,772 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:44,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:44,841 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2025-03-08 22:51:44,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:51:44,841 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:44,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:44,842 INFO L225 Difference]: With dead ends: 96 [2025-03-08 22:51:44,842 INFO L226 Difference]: Without dead ends: 96 [2025-03-08 22:51:44,842 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:44,843 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:44,843 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:44,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-08 22:51:44,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-08 22:51:44,846 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:44,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2025-03-08 22:51:44,850 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 9 [2025-03-08 22:51:44,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:44,850 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2025-03-08 22:51:44,850 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:44,850 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2025-03-08 22:51:44,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 22:51:44,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:44,851 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:44,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:51:44,852 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:44,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:44,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1349516328, now seen corresponding path program 1 times [2025-03-08 22:51:44,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:44,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199355812] [2025-03-08 22:51:44,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:44,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:44,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 22:51:44,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 22:51:44,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:44,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:44,888 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:44,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:44,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199355812] [2025-03-08 22:51:44,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199355812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:44,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:44,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:51:44,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433226771] [2025-03-08 22:51:44,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:44,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:51:44,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:44,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:51:44,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:51:44,889 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:44,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:44,930 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2025-03-08 22:51:44,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:51:44,931 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:44,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:44,931 INFO L225 Difference]: With dead ends: 92 [2025-03-08 22:51:44,931 INFO L226 Difference]: Without dead ends: 92 [2025-03-08 22:51:44,932 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:44,932 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:44,932 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:44,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-08 22:51:44,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-08 22:51:44,935 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:44,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2025-03-08 22:51:44,935 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 9 [2025-03-08 22:51:44,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:44,936 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2025-03-08 22:51:44,936 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:44,936 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2025-03-08 22:51:44,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 22:51:44,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:44,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:44,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:51:44,936 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:44,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:44,937 INFO L85 PathProgramCache]: Analyzing trace with hash 257796813, now seen corresponding path program 1 times [2025-03-08 22:51:44,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:44,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205150870] [2025-03-08 22:51:44,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:44,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:44,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:51:44,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:51:44,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:44,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:45,015 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:45,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:45,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205150870] [2025-03-08 22:51:45,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205150870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:45,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:45,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:51:45,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820211740] [2025-03-08 22:51:45,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:45,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:51:45,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:45,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:51:45,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:45,016 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:45,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:45,119 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2025-03-08 22:51:45,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:51:45,120 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:45,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:45,120 INFO L225 Difference]: With dead ends: 100 [2025-03-08 22:51:45,120 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 22:51:45,121 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:45,121 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:45,122 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:45,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 22:51:45,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2025-03-08 22:51:45,128 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:45,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2025-03-08 22:51:45,128 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 14 [2025-03-08 22:51:45,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:45,128 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2025-03-08 22:51:45,128 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:45,128 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2025-03-08 22:51:45,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 22:51:45,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:45,128 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:45,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:51:45,129 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:45,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:45,129 INFO L85 PathProgramCache]: Analyzing trace with hash 257796814, now seen corresponding path program 1 times [2025-03-08 22:51:45,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:45,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113407164] [2025-03-08 22:51:45,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:45,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:45,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:51:45,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:51:45,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:45,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:45,310 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:45,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:45,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113407164] [2025-03-08 22:51:45,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113407164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:45,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:45,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:51:45,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229753934] [2025-03-08 22:51:45,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:45,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:51:45,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:45,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:51:45,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:51:45,312 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:45,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:45,400 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2025-03-08 22:51:45,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:51:45,400 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:45,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:45,401 INFO L225 Difference]: With dead ends: 96 [2025-03-08 22:51:45,401 INFO L226 Difference]: Without dead ends: 96 [2025-03-08 22:51:45,401 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:45,401 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:45,402 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:45,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-08 22:51:45,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-08 22:51:45,404 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:45,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2025-03-08 22:51:45,404 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 14 [2025-03-08 22:51:45,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:45,405 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2025-03-08 22:51:45,405 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:45,405 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2025-03-08 22:51:45,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 22:51:45,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:45,405 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:45,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:51:45,405 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:45,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:45,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1552595485, now seen corresponding path program 1 times [2025-03-08 22:51:45,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:45,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852302728] [2025-03-08 22:51:45,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:45,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:45,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 22:51:45,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:51:45,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:45,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:45,535 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:45,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:45,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852302728] [2025-03-08 22:51:45,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852302728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:45,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:45,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:51:45,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988858150] [2025-03-08 22:51:45,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:45,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:51:45,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:45,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:51:45,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:51:45,536 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:45,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:45,686 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2025-03-08 22:51:45,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:51:45,686 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:45,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:45,687 INFO L225 Difference]: With dead ends: 152 [2025-03-08 22:51:45,687 INFO L226 Difference]: Without dead ends: 152 [2025-03-08 22:51:45,687 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:45,688 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:45,688 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:45,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-08 22:51:45,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 96. [2025-03-08 22:51:45,693 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:45,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2025-03-08 22:51:45,694 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 17 [2025-03-08 22:51:45,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:45,694 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2025-03-08 22:51:45,694 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:45,694 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2025-03-08 22:51:45,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 22:51:45,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:45,694 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:45,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:51:45,694 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:45,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:45,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1552595486, now seen corresponding path program 1 times [2025-03-08 22:51:45,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:45,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87927615] [2025-03-08 22:51:45,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:45,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:45,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 22:51:45,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:51:45,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:45,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:45,887 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:45,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:45,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87927615] [2025-03-08 22:51:45,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87927615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:45,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:45,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:51:45,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363871931] [2025-03-08 22:51:45,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:45,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:51:45,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:45,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:51:45,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:45,889 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:46,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:46,021 INFO L93 Difference]: Finished difference Result 154 states and 171 transitions. [2025-03-08 22:51:46,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:51:46,022 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:46,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:46,022 INFO L225 Difference]: With dead ends: 154 [2025-03-08 22:51:46,022 INFO L226 Difference]: Without dead ends: 154 [2025-03-08 22:51:46,023 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,023 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:46,023 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:46,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-08 22:51:46,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 96. [2025-03-08 22:51:46,025 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:46,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2025-03-08 22:51:46,026 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 17 [2025-03-08 22:51:46,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:46,026 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2025-03-08 22:51:46,026 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:46,026 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2025-03-08 22:51:46,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 22:51:46,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:46,026 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:46,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:51:46,027 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:46,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:46,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1552594877, now seen corresponding path program 1 times [2025-03-08 22:51:46,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:46,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627816385] [2025-03-08 22:51:46,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:46,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:46,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 22:51:46,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:51:46,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:46,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:46,136 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,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:46,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627816385] [2025-03-08 22:51:46,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627816385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:46,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:46,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:51:46,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445139897] [2025-03-08 22:51:46,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:46,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:51:46,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:46,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:51:46,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:46,138 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:46,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:46,204 INFO L93 Difference]: Finished difference Result 153 states and 169 transitions. [2025-03-08 22:51:46,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:51:46,204 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:46,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:46,205 INFO L225 Difference]: With dead ends: 153 [2025-03-08 22:51:46,206 INFO L226 Difference]: Without dead ends: 153 [2025-03-08 22:51:46,206 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:46,206 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.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:46,207 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.0s Time] [2025-03-08 22:51:46,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-08 22:51:46,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 96. [2025-03-08 22:51:46,210 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:46,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2025-03-08 22:51:46,210 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 17 [2025-03-08 22:51:46,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:46,211 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2025-03-08 22:51:46,211 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:46,211 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2025-03-08 22:51:46,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 22:51:46,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:46,211 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:46,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:51:46,212 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:46,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:46,212 INFO L85 PathProgramCache]: Analyzing trace with hash 2068436799, now seen corresponding path program 1 times [2025-03-08 22:51:46,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:46,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406847337] [2025-03-08 22:51:46,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:46,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:46,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:51:46,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:51:46,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:46,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:46,372 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:46,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:46,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406847337] [2025-03-08 22:51:46,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406847337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:51:46,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898490416] [2025-03-08 22:51:46,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:46,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:46,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:51:46,375 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:46,377 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:46,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:51:46,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:51:46,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:46,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:46,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 22:51:46,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:51:46,482 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:46,497 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:51:46,498 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:46,520 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:46,570 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 22:51:46,570 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:46,589 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:46,593 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:46,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:51:46,618 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-03-08 22:51:46,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2025-03-08 22:51:46,686 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:46,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898490416] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:51:46,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:51:46,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-08 22:51:46,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491221508] [2025-03-08 22:51:46,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:51:46,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 22:51:46,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:46,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 22:51:46,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=124, Unknown=2, NotChecked=0, Total=156 [2025-03-08 22:51:46,687 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:46,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:46,868 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2025-03-08 22:51:46,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:51:46,868 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-08 22:51:46,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:46,869 INFO L225 Difference]: With dead ends: 98 [2025-03-08 22:51:46,869 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 22:51:46,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=183, Unknown=2, NotChecked=0, Total=240 [2025-03-08 22:51:46,869 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 34 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:46,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 483 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:46,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 22:51:46,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2025-03-08 22:51:46,872 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:46,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2025-03-08 22:51:46,873 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 19 [2025-03-08 22:51:46,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:46,874 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2025-03-08 22:51:46,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:46,874 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2025-03-08 22:51:46,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 22:51:46,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:46,876 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:46,884 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:47,080 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:47,080 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:47,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:47,080 INFO L85 PathProgramCache]: Analyzing trace with hash 2068436800, now seen corresponding path program 1 times [2025-03-08 22:51:47,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:47,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217166236] [2025-03-08 22:51:47,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:47,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:47,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:51:47,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:51:47,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:47,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:47,373 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:47,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:47,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217166236] [2025-03-08 22:51:47,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217166236] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:51:47,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167652366] [2025-03-08 22:51:47,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:47,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:47,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:51:47,376 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:47,378 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:47,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:51:47,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:51:47,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:47,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:47,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 22:51:47,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:51:47,457 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:47,468 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:47,476 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:51:47,477 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:47,486 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:47,494 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:47,568 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 22:51:47,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-08 22:51:47,575 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:47,630 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:47,634 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:47,655 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:47,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:51:47,793 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$#2.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_261 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_262) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_261 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 4)))))) is different from false [2025-03-08 22:51:47,810 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$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_261 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_262) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))))))) is different from false [2025-03-08 22:51:47,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:47,818 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:47,821 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:47,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:47,831 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:47,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:47,839 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:47,841 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:51:47,842 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:47,844 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:51:47,845 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:47,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-08 22:51:47,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167652366] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:51:47,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:51:47,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 20 [2025-03-08 22:51:47,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564239796] [2025-03-08 22:51:47,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:51:47,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 22:51:47,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:47,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 22:51:47,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=276, Unknown=7, NotChecked=70, Total=420 [2025-03-08 22:51:47,883 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:48,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:48,352 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2025-03-08 22:51:48,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:51:48,353 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:48,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:48,354 INFO L225 Difference]: With dead ends: 105 [2025-03-08 22:51:48,354 INFO L226 Difference]: Without dead ends: 105 [2025-03-08 22:51:48,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=602, Unknown=7, NotChecked=106, Total=870 [2025-03-08 22:51:48,355 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 36 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 3 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:48,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 629 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 445 Invalid, 15 Unknown, 113 Unchecked, 0.3s Time] [2025-03-08 22:51:48,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-08 22:51:48,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-08 22:51:48,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 104 states have internal predecessors, (116), 0 states have call successors, (0), 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,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2025-03-08 22:51:48,358 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 19 [2025-03-08 22:51:48,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:48,358 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2025-03-08 22:51:48,358 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:48,358 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2025-03-08 22:51:48,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 22:51:48,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:48,359 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:48,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 22:51:48,559 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:48,559 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:48,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:48,560 INFO L85 PathProgramCache]: Analyzing trace with hash 869301779, now seen corresponding path program 1 times [2025-03-08 22:51:48,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:48,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809497482] [2025-03-08 22:51:48,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:48,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:48,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 22:51:48,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 22:51:48,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:48,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:48,633 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,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:48,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809497482] [2025-03-08 22:51:48,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809497482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:48,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:48,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:51:48,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161558462] [2025-03-08 22:51:48,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:48,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:51:48,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:48,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:51:48,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:51:48,634 INFO L87 Difference]: Start difference. First operand 105 states and 116 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:48,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:48,742 INFO L93 Difference]: Finished difference Result 167 states and 181 transitions. [2025-03-08 22:51:48,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:51:48,742 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:48,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:48,743 INFO L225 Difference]: With dead ends: 167 [2025-03-08 22:51:48,743 INFO L226 Difference]: Without dead ends: 167 [2025-03-08 22:51:48,743 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:48,744 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 84 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:48,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 197 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:48,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-08 22:51:48,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 105. [2025-03-08 22:51:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 104 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:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2025-03-08 22:51:48,746 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 20 [2025-03-08 22:51:48,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:48,746 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2025-03-08 22:51:48,746 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:48,746 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2025-03-08 22:51:48,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 22:51:48,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:48,747 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:48,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:51:48,747 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:48,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:48,747 INFO L85 PathProgramCache]: Analyzing trace with hash 869301780, now seen corresponding path program 1 times [2025-03-08 22:51:48,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:48,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132247979] [2025-03-08 22:51:48,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:48,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:48,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 22:51:48,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 22:51:48,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:48,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:48,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:48,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:48,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132247979] [2025-03-08 22:51:48,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132247979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:48,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:48,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:51:48,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258865502] [2025-03-08 22:51:48,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:48,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:51:48,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:48,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:51:48,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:48,856 INFO L87 Difference]: Start difference. First operand 105 states and 115 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:48,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:48,991 INFO L93 Difference]: Finished difference Result 169 states and 187 transitions. [2025-03-08 22:51:48,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:51:48,991 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:48,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:48,992 INFO L225 Difference]: With dead ends: 169 [2025-03-08 22:51:48,992 INFO L226 Difference]: Without dead ends: 169 [2025-03-08 22:51:48,992 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:48,993 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:48,993 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:48,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-08 22:51:48,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 105. [2025-03-08 22:51:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 104 states have internal predecessors, (114), 0 states have call successors, (0), 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,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2025-03-08 22:51:48,995 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 20 [2025-03-08 22:51:48,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:48,995 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2025-03-08 22:51:48,995 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:48,995 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2025-03-08 22:51:48,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 22:51:48,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:48,996 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:48,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:51:48,996 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:48,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:48,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1283484812, now seen corresponding path program 1 times [2025-03-08 22:51:48,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:48,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382023860] [2025-03-08 22:51:48,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:48,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:49,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:51:49,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:51:49,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:49,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:49,205 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:49,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:49,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382023860] [2025-03-08 22:51:49,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382023860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:49,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:49,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:51:49,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434731881] [2025-03-08 22:51:49,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:49,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:51:49,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:49,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:51:49,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:51:49,207 INFO L87 Difference]: Start difference. First operand 105 states and 114 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:49,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:49,356 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2025-03-08 22:51:49,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:51:49,357 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:49,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:49,357 INFO L225 Difference]: With dead ends: 132 [2025-03-08 22:51:49,357 INFO L226 Difference]: Without dead ends: 132 [2025-03-08 22:51:49,358 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:49,358 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 34 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:49,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 433 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:49,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-08 22:51:49,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 120. [2025-03-08 22:51:49,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 119 states have internal predecessors, (130), 0 states have call successors, (0), 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:49,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2025-03-08 22:51:49,360 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 23 [2025-03-08 22:51:49,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:49,360 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2025-03-08 22:51:49,360 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:49,360 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2025-03-08 22:51:49,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 22:51:49,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:49,362 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:49,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:51:49,362 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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:49,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:49,363 INFO L85 PathProgramCache]: Analyzing trace with hash -773337951, now seen corresponding path program 1 times [2025-03-08 22:51:49,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:49,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223312090] [2025-03-08 22:51:49,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:49,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:49,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:51:49,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:51:49,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:49,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:49,431 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:49,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:49,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223312090] [2025-03-08 22:51:49,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223312090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:49,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:49,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:51:49,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349756775] [2025-03-08 22:51:49,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:49,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:51:49,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:49,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:51:49,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:49,433 INFO L87 Difference]: Start difference. First operand 120 states and 130 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:49,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:49,479 INFO L93 Difference]: Finished difference Result 147 states and 162 transitions. [2025-03-08 22:51:49,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:51:49,480 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:49,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:49,480 INFO L225 Difference]: With dead ends: 147 [2025-03-08 22:51:49,480 INFO L226 Difference]: Without dead ends: 147 [2025-03-08 22:51:49,481 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:49,481 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:49,481 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:49,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-08 22:51:49,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 132. [2025-03-08 22:51:49,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 106 states have (on average 1.4622641509433962) internal successors, (155), 131 states have internal predecessors, (155), 0 states have call successors, (0), 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:49,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 155 transitions. [2025-03-08 22:51:49,484 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 155 transitions. Word has length 25 [2025-03-08 22:51:49,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:49,484 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 155 transitions. [2025-03-08 22:51:49,484 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:49,484 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 155 transitions. [2025-03-08 22:51:49,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 22:51:49,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:49,484 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:49,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:51:49,485 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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:49,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:49,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1796327276, now seen corresponding path program 1 times [2025-03-08 22:51:49,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:49,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720116644] [2025-03-08 22:51:49,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:49,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:49,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:51:49,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:51:49,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:49,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:49,564 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:49,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:49,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720116644] [2025-03-08 22:51:49,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720116644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:49,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:49,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:51:49,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976250625] [2025-03-08 22:51:49,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:49,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:51:49,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:49,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:51:49,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:51:49,566 INFO L87 Difference]: Start difference. First operand 132 states and 155 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:49,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:49,654 INFO L93 Difference]: Finished difference Result 186 states and 205 transitions. [2025-03-08 22:51:49,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:51:49,655 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:49,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:49,656 INFO L225 Difference]: With dead ends: 186 [2025-03-08 22:51:49,656 INFO L226 Difference]: Without dead ends: 186 [2025-03-08 22:51:49,656 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:49,656 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:49,656 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:49,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-08 22:51:49,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 133. [2025-03-08 22:51:49,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 107 states have (on average 1.4579439252336448) internal successors, (156), 132 states have internal predecessors, (156), 0 states have call successors, (0), 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:49,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 156 transitions. [2025-03-08 22:51:49,661 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 156 transitions. Word has length 26 [2025-03-08 22:51:49,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:49,661 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 156 transitions. [2025-03-08 22:51:49,661 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:49,662 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 156 transitions. [2025-03-08 22:51:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 22:51:49,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:49,662 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:49,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:51:49,662 INFO L396 AbstractCegarLoop]: === Iteration 19 === 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:49,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:49,663 INFO L85 PathProgramCache]: Analyzing trace with hash -148429313, now seen corresponding path program 1 times [2025-03-08 22:51:49,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:49,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571756022] [2025-03-08 22:51:49,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:49,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:49,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 22:51:49,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 22:51:49,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:49,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:49,751 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:49,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:49,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571756022] [2025-03-08 22:51:49,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571756022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:49,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:49,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:51:49,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502105502] [2025-03-08 22:51:49,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:49,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:51:49,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:49,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:51:49,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:51:49,753 INFO L87 Difference]: Start difference. First operand 133 states and 156 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:49,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:49,860 INFO L93 Difference]: Finished difference Result 189 states and 209 transitions. [2025-03-08 22:51:49,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:51:49,860 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:49,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:49,861 INFO L225 Difference]: With dead ends: 189 [2025-03-08 22:51:49,861 INFO L226 Difference]: Without dead ends: 189 [2025-03-08 22:51:49,861 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:49,861 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:49,862 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:49,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-08 22:51:49,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 136. [2025-03-08 22:51:49,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 110 states have (on average 1.4454545454545455) internal successors, (159), 135 states have internal predecessors, (159), 0 states have call successors, (0), 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:49,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 159 transitions. [2025-03-08 22:51:49,864 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 159 transitions. Word has length 27 [2025-03-08 22:51:49,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:49,864 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 159 transitions. [2025-03-08 22:51:49,865 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:49,865 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 159 transitions. [2025-03-08 22:51:49,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 22:51:49,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:49,865 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:49,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:51:49,865 INFO L396 AbstractCegarLoop]: === Iteration 20 === 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:49,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:49,866 INFO L85 PathProgramCache]: Analyzing trace with hash -306341431, now seen corresponding path program 1 times [2025-03-08 22:51:49,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:49,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349290295] [2025-03-08 22:51:49,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:49,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:49,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:51:49,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:51:49,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:49,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:49,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:49,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:49,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349290295] [2025-03-08 22:51:49,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349290295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:49,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:49,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:51:49,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253841936] [2025-03-08 22:51:49,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:49,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:51:49,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:49,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:51:49,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:51:49,980 INFO L87 Difference]: Start difference. First operand 136 states and 159 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:50,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:50,103 INFO L93 Difference]: Finished difference Result 156 states and 173 transitions. [2025-03-08 22:51:50,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:51:50,104 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:50,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:50,104 INFO L225 Difference]: With dead ends: 156 [2025-03-08 22:51:50,104 INFO L226 Difference]: Without dead ends: 156 [2025-03-08 22:51:50,105 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:50,105 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 99 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:50,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 179 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:51:50,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-08 22:51:50,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 137. [2025-03-08 22:51:50,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 111 states have (on average 1.4504504504504505) internal successors, (161), 136 states have internal predecessors, (161), 0 states have call successors, (0), 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:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 161 transitions. [2025-03-08 22:51:50,108 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 161 transitions. Word has length 28 [2025-03-08 22:51:50,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:50,108 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 161 transitions. [2025-03-08 22:51:50,108 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:50,108 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 161 transitions. [2025-03-08 22:51:50,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 22:51:50,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:50,109 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:50,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:51:50,109 INFO L396 AbstractCegarLoop]: === Iteration 21 === 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:50,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:50,109 INFO L85 PathProgramCache]: Analyzing trace with hash -306341430, now seen corresponding path program 1 times [2025-03-08 22:51:50,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:50,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637996006] [2025-03-08 22:51:50,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:50,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:50,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:51:50,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:51:50,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:50,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:50,155 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:50,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:50,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637996006] [2025-03-08 22:51:50,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637996006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:50,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:50,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:51:50,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179221756] [2025-03-08 22:51:50,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:50,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:51:50,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:50,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:51:50,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:51:50,157 INFO L87 Difference]: Start difference. First operand 137 states and 161 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:50,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:50,191 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2025-03-08 22:51:50,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:51:50,191 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:50,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:50,192 INFO L225 Difference]: With dead ends: 132 [2025-03-08 22:51:50,192 INFO L226 Difference]: Without dead ends: 132 [2025-03-08 22:51:50,192 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:50,192 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 106 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:50,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 52 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:51:50,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-08 22:51:50,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-03-08 22:51:50,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 111 states have (on average 1.3783783783783783) internal successors, (153), 131 states have internal predecessors, (153), 0 states have call successors, (0), 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:50,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 153 transitions. [2025-03-08 22:51:50,195 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 153 transitions. Word has length 28 [2025-03-08 22:51:50,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:50,196 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 153 transitions. [2025-03-08 22:51:50,196 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:50,196 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2025-03-08 22:51:50,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 22:51:50,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:50,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:50,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 22:51:50,196 INFO L396 AbstractCegarLoop]: === Iteration 22 === 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:50,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:50,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1978361454, now seen corresponding path program 1 times [2025-03-08 22:51:50,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:50,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876522421] [2025-03-08 22:51:50,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:50,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:50,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:51:50,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:51:50,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:50,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:50,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:50,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:50,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876522421] [2025-03-08 22:51:50,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876522421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:50,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:50,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:51:50,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314926227] [2025-03-08 22:51:50,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:50,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:51:50,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:50,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:51:50,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:51:50,412 INFO L87 Difference]: Start difference. First operand 132 states and 153 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:50,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:50,632 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2025-03-08 22:51:50,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:51:50,632 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:50,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:50,635 INFO L225 Difference]: With dead ends: 153 [2025-03-08 22:51:50,635 INFO L226 Difference]: Without dead ends: 153 [2025-03-08 22:51:50,636 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:50,637 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 73 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:50,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 335 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:51:50,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-08 22:51:50,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 137. [2025-03-08 22:51:50,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.3675213675213675) internal successors, (160), 136 states have internal predecessors, (160), 0 states have call successors, (0), 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:50,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 160 transitions. [2025-03-08 22:51:50,640 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 160 transitions. Word has length 28 [2025-03-08 22:51:50,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:50,640 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 160 transitions. [2025-03-08 22:51:50,640 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:50,640 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 160 transitions. [2025-03-08 22:51:50,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 22:51:50,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:50,641 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:50,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:51:50,641 INFO L396 AbstractCegarLoop]: === Iteration 23 === 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:50,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:50,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1978361453, now seen corresponding path program 1 times [2025-03-08 22:51:50,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:50,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225652917] [2025-03-08 22:51:50,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:50,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:50,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:51:50,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:51:50,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:50,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:50,967 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:50,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:50,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225652917] [2025-03-08 22:51:50,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225652917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:50,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:50,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:51:50,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53273813] [2025-03-08 22:51:50,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:50,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:51:50,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:50,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:51:50,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:51:50,969 INFO L87 Difference]: Start difference. First operand 137 states and 160 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:51,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:51,189 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2025-03-08 22:51:51,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:51:51,190 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:51,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:51,191 INFO L225 Difference]: With dead ends: 154 [2025-03-08 22:51:51,191 INFO L226 Difference]: Without dead ends: 154 [2025-03-08 22:51:51,191 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:51,191 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 61 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:51,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 347 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:51:51,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-08 22:51:51,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 137. [2025-03-08 22:51:51,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.3333333333333333) internal successors, (156), 136 states have internal predecessors, (156), 0 states have call successors, (0), 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,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2025-03-08 22:51:51,195 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 28 [2025-03-08 22:51:51,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:51,195 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2025-03-08 22:51:51,195 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:51,195 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2025-03-08 22:51:51,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 22:51:51,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:51,196 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:51:51,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:51:51,196 INFO L396 AbstractCegarLoop]: === Iteration 24 === 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:51,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:51,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1944164352, now seen corresponding path program 2 times [2025-03-08 22:51:51,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:51,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307381956] [2025-03-08 22:51:51,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:51:51,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:51,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-08 22:51:51,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 22:51:51,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:51:51,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:51,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:51,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307381956] [2025-03-08 22:51:51,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307381956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:51:51,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657738360] [2025-03-08 22:51:51,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:51:51,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:51,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:51:51,596 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:51,598 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:51,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-08 22:51:51,685 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 22:51:51,685 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:51:51,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:51,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 22:51:51,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:51:51,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:51:51,697 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:51,703 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:51:51,703 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:51,725 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:51,729 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:51,816 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 22:51:51,816 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:51,820 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:51,903 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 22:51:51,904 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:51,911 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:51,996 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-08 22:51:51,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-08 22:51:52,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-08 22:51:52,050 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:52,054 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:52,074 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:51:52,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:51:52,157 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_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_599) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_598 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) is different from false [2025-03-08 22:51:52,218 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$#2.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_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_599) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_598 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8)))))) is different from false [2025-03-08 22:51:52,229 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_597))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_596) .cse1 v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_599) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_596) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) is different from false [2025-03-08 22:51:52,253 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)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_596) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_597) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8))) (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_597))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_596) .cse3 v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_599) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))))))))) is different from false [2025-03-08 22:51:52,273 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$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse3 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_597))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_596) .cse1 v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 16) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_599) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_596) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_597) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 12)))))) is different from false [2025-03-08 22:51:52,291 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4)) (.cse3 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_595 (Array Int Int)) (v_ArrVal_594 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_595))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse4 (store .cse5 .cse0 v_ArrVal_597))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_594) .cse0 v_ArrVal_596) .cse1 v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 16) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_599) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_595 (Array Int Int)) (v_ArrVal_594 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_595))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_594) .cse6 v_ArrVal_596) (select (select (store .cse7 .cse6 v_ArrVal_597) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_598))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 12))))) is different from false [2025-03-08 22:51:52,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:52,829 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 177 treesize of output 178 [2025-03-08 22:51:52,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:52,836 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 167 treesize of output 108 [2025-03-08 22:51:52,842 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 4252 treesize of output 3550 [2025-03-08 22:51:52,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 788 treesize of output 752 [2025-03-08 22:51:52,888 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 56 treesize of output 52 [2025-03-08 22:51:52,891 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 52 treesize of output 48 [2025-03-08 22:51:52,895 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 48 treesize of output 36 [2025-03-08 22:51:52,898 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 36 treesize of output 32 [2025-03-08 22:51:52,901 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 57 treesize of output 45 [2025-03-08 22:51:52,906 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:52,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:52,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 91 [2025-03-08 22:51:52,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:52,929 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 80 treesize of output 61 [2025-03-08 22:51:52,931 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:51:52,933 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 85 treesize of output 55 [2025-03-08 22:51:52,936 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:51:52,937 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:52,991 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 21 not checked. [2025-03-08 22:51:52,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657738360] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:51:52,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:51:52,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 15] total 37 [2025-03-08 22:51:52,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785965961] [2025-03-08 22:51:52,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:51:52,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-08 22:51:52,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:52,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-08 22:51:52,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=818, Unknown=20, NotChecked=390, Total=1406 [2025-03-08 22:51:52,996 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand has 38 states, 37 states have (on average 2.0) internal successors, (74), 38 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:54,668 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$#2.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (.cse0 (select (select |c_#memory_$Pointer$#2.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_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_599) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (<= (+ .cse2 .cse3 8) (select |c_#length| .cse0)) (= (select |c_#valid| |c_ULTIMATE.start_create_data_~data~0#1.base|) 1) (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_597))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_596) .cse4 v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 16) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_599) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (<= 0 (+ .cse2 .cse3 4)) (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_596) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_597) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 12))) (forall ((v_ArrVal_598 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8)))))) is different from false [2025-03-08 22:51:54,682 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$#2.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_596) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_597) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8))) (<= 0 (+ .cse2 .cse3)) (<= (+ .cse2 .cse3 4) (select |c_#length| .cse0)) (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_597))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_596) .cse4 v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_599) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_598 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 4))) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_599) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))))))) is different from false [2025-03-08 22:51:54,694 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_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_599) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (<= (+ .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_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_597))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (<= (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_596) .cse2 v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_599) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_598 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_596) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) is different from false [2025-03-08 22:51:54,714 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$#2.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (.cse0 (select (select |c_#memory_$Pointer$#2.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_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_599) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (<= (+ .cse2 .cse3 8) (select |c_#length| .cse0)) (<= 0 (+ .cse2 .cse3 4)) (forall ((v_ArrVal_598 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8)))))) is different from false [2025-03-08 22:51:54,717 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.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_598 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse0 4))) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse0 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse2 v_ArrVal_599) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) is different from false [2025-03-08 22:51:54,732 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_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_599) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (<= (+ .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_598 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_598) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) is different from false [2025-03-08 22:51:54,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:54,838 INFO L93 Difference]: Finished difference Result 159 states and 180 transitions. [2025-03-08 22:51:54,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 22:51:54,839 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.0) internal successors, (74), 38 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-08 22:51:54,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:54,839 INFO L225 Difference]: With dead ends: 159 [2025-03-08 22:51:54,839 INFO L226 Difference]: Without dead ends: 159 [2025-03-08 22:51:54,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=344, Invalid=1484, Unknown=26, NotChecked=1116, Total=2970 [2025-03-08 22:51:54,841 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 52 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 7 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 770 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:54,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 941 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 689 Invalid, 28 Unknown, 770 Unchecked, 1.3s Time] [2025-03-08 22:51:54,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-08 22:51:54,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2025-03-08 22:51:54,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 156 states have internal predecessors, (178), 0 states have call successors, (0), 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,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 178 transitions. [2025-03-08 22:51:54,844 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 178 transitions. Word has length 29 [2025-03-08 22:51:54,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:54,844 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 178 transitions. [2025-03-08 22:51:54,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.0) internal successors, (74), 38 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:51:54,844 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 178 transitions. [2025-03-08 22:51:54,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 22:51:54,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:54,844 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:54,851 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:55,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:55,049 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:55,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:55,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1824836528, now seen corresponding path program 1 times [2025-03-08 22:51:55,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:55,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368483696] [2025-03-08 22:51:55,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:55,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:55,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:51:55,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:51:55,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:55,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:55,580 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,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:55,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368483696] [2025-03-08 22:51:55,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368483696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:55,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:55,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 22:51:55,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875598640] [2025-03-08 22:51:55,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:55,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 22:51:55,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:55,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 22:51:55,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:51:55,581 INFO L87 Difference]: Start difference. First operand 157 states and 178 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 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:55,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:55,968 INFO L93 Difference]: Finished difference Result 207 states and 234 transitions. [2025-03-08 22:51:55,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 22:51:55,968 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 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:55,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:55,969 INFO L225 Difference]: With dead ends: 207 [2025-03-08 22:51:55,969 INFO L226 Difference]: Without dead ends: 207 [2025-03-08 22:51:55,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2025-03-08 22:51:55,970 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 69 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:55,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 531 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:51:55,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-08 22:51:55,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 179. [2025-03-08 22:51:55,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 159 states have (on average 1.2767295597484276) internal successors, (203), 178 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:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 203 transitions. [2025-03-08 22:51:55,973 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 203 transitions. Word has length 31 [2025-03-08 22:51:55,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:55,973 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 203 transitions. [2025-03-08 22:51:55,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 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:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 203 transitions. [2025-03-08 22:51:55,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 22:51:55,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:55,974 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:55,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 22:51:55,974 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:55,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:55,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1824835823, now seen corresponding path program 1 times [2025-03-08 22:51:55,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:55,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102540513] [2025-03-08 22:51:55,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:55,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:55,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:51:55,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:51:55,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:55,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:56,177 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,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:56,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102540513] [2025-03-08 22:51:56,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102540513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:56,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:56,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:51:56,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714139170] [2025-03-08 22:51:56,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:56,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:51:56,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:56,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:51:56,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:51:56,179 INFO L87 Difference]: Start difference. First operand 179 states and 203 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:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:56,455 INFO L93 Difference]: Finished difference Result 195 states and 214 transitions. [2025-03-08 22:51:56,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:51:56,456 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:56,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:56,456 INFO L225 Difference]: With dead ends: 195 [2025-03-08 22:51:56,456 INFO L226 Difference]: Without dead ends: 195 [2025-03-08 22:51:56,457 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:56,457 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 51 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:56,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 520 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:51:56,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-08 22:51:56,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 179. [2025-03-08 22:51:56,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 159 states have (on average 1.2641509433962264) internal successors, (201), 178 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:56,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 201 transitions. [2025-03-08 22:51:56,462 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 201 transitions. Word has length 31 [2025-03-08 22:51:56,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:56,462 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 201 transitions. [2025-03-08 22:51:56,462 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:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 201 transitions. [2025-03-08 22:51:56,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 22:51:56,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:56,463 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:56,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 22:51:56,463 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:56,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:56,464 INFO L85 PathProgramCache]: Analyzing trace with hash -735357523, now seen corresponding path program 1 times [2025-03-08 22:51:56,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:56,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002422827] [2025-03-08 22:51:56,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:56,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:56,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 22:51:56,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 22:51:56,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:56,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:56,983 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,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:56,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002422827] [2025-03-08 22:51:56,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002422827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:51:56,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:51:56,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 22:51:56,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838160592] [2025-03-08 22:51:56,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:51:56,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 22:51:56,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:56,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 22:51:56,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-08 22:51:56,984 INFO L87 Difference]: Start difference. First operand 179 states and 201 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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:57,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:57,478 INFO L93 Difference]: Finished difference Result 198 states and 221 transitions. [2025-03-08 22:51:57,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 22:51:57,479 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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:57,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:57,480 INFO L225 Difference]: With dead ends: 198 [2025-03-08 22:51:57,480 INFO L226 Difference]: Without dead ends: 196 [2025-03-08 22:51:57,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2025-03-08 22:51:57,480 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 60 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:57,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 678 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:51:57,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-08 22:51:57,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 177. [2025-03-08 22:51:57,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 157 states have (on average 1.2611464968152866) internal successors, (198), 176 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:57,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 198 transitions. [2025-03-08 22:51:57,484 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 198 transitions. Word has length 32 [2025-03-08 22:51:57,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:57,484 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 198 transitions. [2025-03-08 22:51:57,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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:57,485 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 198 transitions. [2025-03-08 22:51:57,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 22:51:57,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:57,485 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:57,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 22:51:57,485 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:57,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:57,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1954222311, now seen corresponding path program 1 times [2025-03-08 22:51:57,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:57,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799276445] [2025-03-08 22:51:57,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:57,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:57,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 22:51:57,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 22:51:57,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:57,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:57,981 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:57,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:57,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799276445] [2025-03-08 22:51:57,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799276445] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:51:57,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049444301] [2025-03-08 22:51:57,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:57,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:57,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:51:57,983 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:57,985 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:58,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 22:51:58,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 22:51:58,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:58,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:58,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-08 22:51:58,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:51:58,151 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:51:58,152 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:58,191 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,196 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:58,295 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:58,305 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:58,356 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:51:58,358 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:58,487 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:51:58,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:58,492 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:58,500 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2025-03-08 22:51:58,500 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:58,696 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:58,703 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,738 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:58,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:51:58,889 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:59,051 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:59,070 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:59,205 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:59,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049444301] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:51:59,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:51:59,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 32 [2025-03-08 22:51:59,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165597439] [2025-03-08 22:51:59,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:51:59,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 22:51:59,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:59,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 22:51:59,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2025-03-08 22:51:59,207 INFO L87 Difference]: Start difference. First operand 177 states and 198 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:59,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:59,729 INFO L93 Difference]: Finished difference Result 268 states and 296 transitions. [2025-03-08 22:51:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:51:59,729 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:59,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:59,730 INFO L225 Difference]: With dead ends: 268 [2025-03-08 22:51:59,730 INFO L226 Difference]: Without dead ends: 268 [2025-03-08 22:51:59,731 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:59,731 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 173 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:59,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1079 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:51:59,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-08 22:51:59,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 206. [2025-03-08 22:51:59,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 186 states have (on average 1.2311827956989247) internal successors, (229), 205 states have internal predecessors, (229), 0 states have call successors, (0), 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:59,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 229 transitions. [2025-03-08 22:51:59,734 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 229 transitions. Word has length 33 [2025-03-08 22:51:59,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:59,734 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 229 transitions. [2025-03-08 22:51:59,734 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:59,734 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 229 transitions. [2025-03-08 22:51:59,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 22:51:59,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:59,735 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:59,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 22:51:59,938 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:59,938 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:59,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:59,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1954222919, now seen corresponding path program 1 times [2025-03-08 22:51:59,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:59,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485678863] [2025-03-08 22:51:59,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:59,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:59,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 22:51:59,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 22:51:59,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:59,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:52:00,131 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:52:00,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:52:00,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485678863] [2025-03-08 22:52:00,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485678863] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:52:00,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609710415] [2025-03-08 22:52:00,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:52:00,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:52:00,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:52:00,133 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:52:00,135 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:52:00,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 22:52:00,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 22:52:00,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:52:00,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:52:00,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 22:52:00,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:52:00,402 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-03-08 22:52:00,402 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:52:00,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:00,725 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:52:00,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-03-08 22:52:00,990 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:52:00,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:52:01,127 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:52:01,250 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_append_~pointerToList#1.offset| Int) (v_ArrVal_837 Int) (|v_ULTIMATE.start_append_~node~0#1.base_16| Int)) (let ((.cse0 (select (store (select |c_#memory_$Pointer$#1.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 (= .cse0 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_16|) 0)) (= (store (store (store |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_16| v_ArrVal_837) .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:52:01,256 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:52:01,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609710415] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:52:01,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:52:01,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 10] total 24 [2025-03-08 22:52:01,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566335178] [2025-03-08 22:52:01,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:52:01,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 22:52:01,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:52:01,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 22:52:01,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=472, Unknown=7, NotChecked=44, Total=600 [2025-03-08 22:52:01,257 INFO L87 Difference]: Start difference. First operand 206 states and 229 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:52:01,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:52:01,953 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions. [2025-03-08 22:52:01,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:52:01,954 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:52:01,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:52:01,954 INFO L225 Difference]: With dead ends: 218 [2025-03-08 22:52:01,954 INFO L226 Difference]: Without dead ends: 198 [2025-03-08 22:52:01,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=151, Invalid=776, Unknown=7, NotChecked=58, Total=992 [2025-03-08 22:52:01,955 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 26 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:52:01,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 634 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 574 Invalid, 0 Unknown, 78 Unchecked, 0.4s Time] [2025-03-08 22:52:01,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-08 22:52:01,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 188. [2025-03-08 22:52:01,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 168 states have (on average 1.25) internal successors, (210), 187 states have internal predecessors, (210), 0 states have call successors, (0), 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:01,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 210 transitions. [2025-03-08 22:52:01,958 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 210 transitions. Word has length 33 [2025-03-08 22:52:01,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:52:01,958 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 210 transitions. [2025-03-08 22:52:01,958 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:52:01,958 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 210 transitions. [2025-03-08 22:52:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 22:52:01,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:52:01,958 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:52:01,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 22:52:02,160 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:52:02,161 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:52:02,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:52:02,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2012018817, now seen corresponding path program 1 times [2025-03-08 22:52:02,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:52:02,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144597544] [2025-03-08 22:52:02,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:52:02,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:52:02,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 22:52:02,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 22:52:02,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:52:02,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:52:02,389 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:52:02,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:52:02,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144597544] [2025-03-08 22:52:02,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144597544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:52:02,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:52:02,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 22:52:02,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364904341] [2025-03-08 22:52:02,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:52:02,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 22:52:02,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:52:02,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 22:52:02,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:52:02,391 INFO L87 Difference]: Start difference. First operand 188 states and 210 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:52:02,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:52:02,678 INFO L93 Difference]: Finished difference Result 207 states and 224 transitions. [2025-03-08 22:52:02,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:52:02,679 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:52:02,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:52:02,679 INFO L225 Difference]: With dead ends: 207 [2025-03-08 22:52:02,679 INFO L226 Difference]: Without dead ends: 207 [2025-03-08 22:52:02,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-03-08 22:52:02,681 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 100 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:52:02,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 386 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:52:02,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-08 22:52:02,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 190. [2025-03-08 22:52:02,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 170 states have (on average 1.2470588235294118) internal successors, (212), 189 states have internal predecessors, (212), 0 states have call successors, (0), 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:02,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2025-03-08 22:52:02,685 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 34 [2025-03-08 22:52:02,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:52:02,685 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2025-03-08 22:52:02,685 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:52:02,685 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2025-03-08 22:52:02,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 22:52:02,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:52:02,685 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:52:02,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 22:52:02,686 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:52:02,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:52:02,686 INFO L85 PathProgramCache]: Analyzing trace with hash -511022676, now seen corresponding path program 1 times [2025-03-08 22:52:02,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:52:02,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43608558] [2025-03-08 22:52:02,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:52:02,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:52:02,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 22:52:02,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 22:52:02,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:52:02,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:52:02,947 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:52:02,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:52:02,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43608558] [2025-03-08 22:52:02,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43608558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:52:02,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:52:02,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 22:52:02,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84668065] [2025-03-08 22:52:02,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:52:02,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 22:52:02,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:52:02,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 22:52:02,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:52:02,948 INFO L87 Difference]: Start difference. First operand 190 states and 212 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:52:03,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:52:03,336 INFO L93 Difference]: Finished difference Result 262 states and 286 transitions. [2025-03-08 22:52:03,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 22:52:03,336 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:52:03,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:52:03,337 INFO L225 Difference]: With dead ends: 262 [2025-03-08 22:52:03,337 INFO L226 Difference]: Without dead ends: 262 [2025-03-08 22:52:03,337 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:52:03,337 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 109 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:52:03,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 499 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:52:03,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-08 22:52:03,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 193. [2025-03-08 22:52:03,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 173 states have (on average 1.2427745664739884) internal successors, (215), 192 states have internal predecessors, (215), 0 states have call successors, (0), 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:03,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 215 transitions. [2025-03-08 22:52:03,340 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 215 transitions. Word has length 37 [2025-03-08 22:52:03,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:52:03,340 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 215 transitions. [2025-03-08 22:52:03,340 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:52:03,340 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 215 transitions. [2025-03-08 22:52:03,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 22:52:03,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:52:03,340 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:52:03,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 22:52:03,340 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:52:03,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:52:03,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1160288329, now seen corresponding path program 1 times [2025-03-08 22:52:03,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:52:03,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058075478] [2025-03-08 22:52:03,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:52:03,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:52:03,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 22:52:03,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 22:52:03,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:52:03,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:52:03,547 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:52:03,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:52:03,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058075478] [2025-03-08 22:52:03,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058075478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:52:03,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:52:03,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 22:52:03,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774779660] [2025-03-08 22:52:03,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:52:03,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 22:52:03,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:52:03,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 22:52:03,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:52:03,549 INFO L87 Difference]: Start difference. First operand 193 states and 215 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:52:03,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:52:03,767 INFO L93 Difference]: Finished difference Result 213 states and 233 transitions. [2025-03-08 22:52:03,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:52:03,767 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:52:03,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:52:03,768 INFO L225 Difference]: With dead ends: 213 [2025-03-08 22:52:03,768 INFO L226 Difference]: Without dead ends: 210 [2025-03-08 22:52:03,768 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:52:03,768 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 74 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:52:03,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 552 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:52:03,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-08 22:52:03,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 193. [2025-03-08 22:52:03,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 173 states have (on average 1.23121387283237) internal successors, (213), 192 states have internal predecessors, (213), 0 states have call successors, (0), 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:03,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 213 transitions. [2025-03-08 22:52:03,772 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 213 transitions. Word has length 38 [2025-03-08 22:52:03,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:52:03,772 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 213 transitions. [2025-03-08 22:52:03,772 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:52:03,772 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 213 transitions. [2025-03-08 22:52:03,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 22:52:03,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:52:03,772 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:52:03,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 22:52:03,773 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:52:03,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:52:03,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1338166204, now seen corresponding path program 1 times [2025-03-08 22:52:03,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:52:03,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799844539] [2025-03-08 22:52:03,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:52:03,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:52:03,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 22:52:03,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 22:52:03,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:52:03,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:52:03,869 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:52:03,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:52:03,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799844539] [2025-03-08 22:52:03,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799844539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:52:03,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:52:03,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:52:03,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972635469] [2025-03-08 22:52:03,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:52:03,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:52:03,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:52:03,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:52:03,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:52:03,871 INFO L87 Difference]: Start difference. First operand 193 states and 213 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:52:03,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:52:03,974 INFO L93 Difference]: Finished difference Result 202 states and 216 transitions. [2025-03-08 22:52:03,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:52:03,975 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:52:03,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:52:03,975 INFO L225 Difference]: With dead ends: 202 [2025-03-08 22:52:03,975 INFO L226 Difference]: Without dead ends: 202 [2025-03-08 22:52:03,976 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:52:03,976 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 131 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:52:03,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 172 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:52:03,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-08 22:52:03,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 189. [2025-03-08 22:52:03,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 169 states have (on average 1.242603550295858) internal successors, (210), 188 states have internal predecessors, (210), 0 states have call successors, (0), 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:03,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 210 transitions. [2025-03-08 22:52:03,978 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 210 transitions. Word has length 38 [2025-03-08 22:52:03,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:52:03,978 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 210 transitions. [2025-03-08 22:52:03,979 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:52:03,979 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 210 transitions. [2025-03-08 22:52:03,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 22:52:03,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:52:03,979 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, 1, 1, 1, 1, 1] [2025-03-08 22:52:03,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 22:52:03,979 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-03-08 22:52:03,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:52:03,980 INFO L85 PathProgramCache]: Analyzing trace with hash -524288762, now seen corresponding path program 1 times [2025-03-08 22:52:03,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:52:03,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799643350] [2025-03-08 22:52:03,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:52:03,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:52:03,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 22:52:03,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 22:52:03,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:52:03,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:52:04,488 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:52:04,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:52:04,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799643350] [2025-03-08 22:52:04,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799643350] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:52:04,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74005477] [2025-03-08 22:52:04,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:52:04,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:52:04,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:52:04,490 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:52:04,491 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:52:04,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 22:52:04,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 22:52:04,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:52:04,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:52:04,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-03-08 22:52:04,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:52:04,618 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:52:04,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:52:04,647 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 15 treesize of output 15 [2025-03-08 22:52:04,683 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:52:04,689 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:52:04,743 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:52:04,743 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:52:04,798 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 20 treesize of output 15 [2025-03-08 22:52:04,804 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 21 treesize of output 16 [2025-03-08 22:52:04,838 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 21 treesize of output 16 [2025-03-08 22:52:04,848 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 20 treesize of output 15 [2025-03-08 22:52:04,962 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 28 treesize of output 16 [2025-03-08 22:52:04,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-08 22:52:05,039 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2025-03-08 22:52:05,040 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 34 [2025-03-08 22:52:05,474 INFO L349 Elim1Store]: treesize reduction 24, result has 54.7 percent of original size [2025-03-08 22:52:05,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 157 [2025-03-08 22:52:06,631 INFO L349 Elim1Store]: treesize reduction 590, result has 55.6 percent of original size [2025-03-08 22:52:06,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 2 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 118 case distinctions, treesize of input 293 treesize of output 893