./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-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 cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:58:34,488 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:58:34,540 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 11:58:34,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:58:34,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:58:34,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:58:34,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:58:34,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:58:34,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:58:34,567 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:58:34,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:58:34,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:58:34,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:58:34,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:58:34,567 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:58:34,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:58:34,568 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:58:34,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:58:34,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:58:34,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:58:34,568 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:58:34,568 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:58:34,568 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:58:34,568 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:58:34,568 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:58:34,568 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:58:34,568 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:58:34,569 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:58:34,569 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:58:34,569 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:58:34,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:58:34,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:58:34,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:58:34,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:58:34,569 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:58:34,569 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:58:34,569 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:58:34,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:58:34,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:58:34,570 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:58:34,570 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:58:34,570 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:58:34,570 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 -> cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d [2025-03-17 11:58:34,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:58:34,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:58:34,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:58:34,785 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:58:34,786 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:58:34,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2025-03-17 11:58:35,915 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e31615c60/6f2f1c2b195a4412ba1e56a9bb7e9893/FLAG473bec7bf [2025-03-17 11:58:36,146 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:58:36,147 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2025-03-17 11:58:36,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e31615c60/6f2f1c2b195a4412ba1e56a9bb7e9893/FLAG473bec7bf [2025-03-17 11:58:36,477 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e31615c60/6f2f1c2b195a4412ba1e56a9bb7e9893 [2025-03-17 11:58:36,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:58:36,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:58:36,480 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:58:36,480 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:58:36,483 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:58:36,484 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:58:36" (1/1) ... [2025-03-17 11:58:36,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a83808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36, skipping insertion in model container [2025-03-17 11:58:36,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:58:36" (1/1) ... [2025-03-17 11:58:36,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:58:36,707 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:58:36,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:58:36,743 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:58:36,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:58:36,811 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:58:36,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36 WrapperNode [2025-03-17 11:58:36,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:58:36,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:58:36,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:58:36,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:58:36,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36" (1/1) ... [2025-03-17 11:58:36,826 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36" (1/1) ... [2025-03-17 11:58:36,839 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102 [2025-03-17 11:58:36,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:58:36,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:58:36,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:58:36,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:58:36,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36" (1/1) ... [2025-03-17 11:58:36,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36" (1/1) ... [2025-03-17 11:58:36,848 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36" (1/1) ... [2025-03-17 11:58:36,859 INFO L175 MemorySlicer]: Split 44 memory accesses to 3 slices as follows [2, 31, 11]. 70 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 16, 2]. [2025-03-17 11:58:36,860 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36" (1/1) ... [2025-03-17 11:58:36,860 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36" (1/1) ... [2025-03-17 11:58:36,873 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36" (1/1) ... [2025-03-17 11:58:36,874 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36" (1/1) ... [2025-03-17 11:58:36,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36" (1/1) ... [2025-03-17 11:58:36,876 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36" (1/1) ... [2025-03-17 11:58:36,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:58:36,879 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:58:36,879 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:58:36,879 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:58:36,880 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36" (1/1) ... [2025-03-17 11:58:36,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:58:36,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:58:36,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:58:36,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:58:36,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:58:36,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 11:58:36,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 11:58:36,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:58:36,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 11:58:36,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 11:58:36,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:58:36,921 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2025-03-17 11:58:36,921 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2025-03-17 11:58:36,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:58:36,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:58:36,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 11:58:36,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 11:58:36,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 11:58:36,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 11:58:36,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 11:58:36,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 11:58:36,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:58:36,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 11:58:36,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 11:58:36,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 11:58:36,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 11:58:36,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 11:58:36,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 11:58:36,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:58:36,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:58:37,022 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:58:37,024 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:58:37,246 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L553: havoc #t~mem5.base, #t~mem5.offset; [2025-03-17 11:58:37,385 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L597: 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-17 11:58:37,401 INFO L? ?]: Removed 202 outVars from TransFormulas that were not future-live. [2025-03-17 11:58:37,401 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:58:37,410 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:58:37,411 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:58:37,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:58:37 BoogieIcfgContainer [2025-03-17 11:58:37,411 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:58:37,413 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:58:37,413 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:58:37,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:58:37,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:58:36" (1/3) ... [2025-03-17 11:58:37,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b1efcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:58:37, skipping insertion in model container [2025-03-17 11:58:37,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:36" (2/3) ... [2025-03-17 11:58:37,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b1efcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:58:37, skipping insertion in model container [2025-03-17 11:58:37,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:58:37" (3/3) ... [2025-03-17 11:58:37,418 INFO L128 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-2.i [2025-03-17 11:58:37,427 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:58:37,429 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG complex_data_creation_test02-2.i that has 2 procedures, 192 locations, 1 initial locations, 5 loop locations, and 92 error locations. [2025-03-17 11:58:37,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:58:37,471 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;@60390399, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:58:37,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2025-03-17 11:58:37,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 96 states have (on average 2.125) internal successors, (204), 188 states have internal predecessors, (204), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:37,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 11:58:37,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:37,479 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 11:58:37,479 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:37,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:37,482 INFO L85 PathProgramCache]: Analyzing trace with hash 237236, now seen corresponding path program 1 times [2025-03-17 11:58:37,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:37,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938717191] [2025-03-17 11:58:37,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:37,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:37,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 11:58:37,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 11:58:37,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:37,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:37,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:37,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938717191] [2025-03-17 11:58:37,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938717191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:37,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:37,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:58:37,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534080756] [2025-03-17 11:58:37,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:37,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:58:37,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:37,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:58:37,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:58:37,605 INFO L87 Difference]: Start difference. First operand has 192 states, 96 states have (on average 2.125) internal successors, (204), 188 states have internal predecessors, (204), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:37,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:37,629 INFO L93 Difference]: Finished difference Result 192 states and 204 transitions. [2025-03-17 11:58:37,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:58:37,631 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-03-17 11:58:37,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:37,636 INFO L225 Difference]: With dead ends: 192 [2025-03-17 11:58:37,637 INFO L226 Difference]: Without dead ends: 190 [2025-03-17 11:58:37,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:58:37,641 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:37,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:58:37,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-17 11:58:37,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2025-03-17 11:58:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 95 states have (on average 2.0842105263157893) internal successors, (198), 186 states have internal predecessors, (198), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:37,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 202 transitions. [2025-03-17 11:58:37,683 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 202 transitions. Word has length 3 [2025-03-17 11:58:37,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:37,683 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 202 transitions. [2025-03-17 11:58:37,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:37,683 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 202 transitions. [2025-03-17 11:58:37,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 11:58:37,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:37,683 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 11:58:37,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:58:37,683 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:37,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:37,684 INFO L85 PathProgramCache]: Analyzing trace with hash 237262, now seen corresponding path program 1 times [2025-03-17 11:58:37,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:37,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942576277] [2025-03-17 11:58:37,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:37,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:37,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 11:58:37,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 11:58:37,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:37,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:37,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:37,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:37,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942576277] [2025-03-17 11:58:37,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942576277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:37,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:37,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:58:37,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997695158] [2025-03-17 11:58:37,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:37,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:58:37,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:37,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:58:37,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:58:37,824 INFO L87 Difference]: Start difference. First operand 190 states and 202 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:38,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:38,038 INFO L93 Difference]: Finished difference Result 184 states and 196 transitions. [2025-03-17 11:58:38,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:58:38,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-03-17 11:58:38,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:38,039 INFO L225 Difference]: With dead ends: 184 [2025-03-17 11:58:38,039 INFO L226 Difference]: Without dead ends: 184 [2025-03-17 11:58:38,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:58:38,040 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 76 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:38,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 311 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:58:38,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-17 11:58:38,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-03-17 11:58:38,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 95 states have (on average 2.0210526315789474) internal successors, (192), 180 states have internal predecessors, (192), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:38,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 196 transitions. [2025-03-17 11:58:38,049 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 196 transitions. Word has length 3 [2025-03-17 11:58:38,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:38,049 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 196 transitions. [2025-03-17 11:58:38,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:38,053 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 196 transitions. [2025-03-17 11:58:38,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 11:58:38,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:38,053 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 11:58:38,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:58:38,053 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:38,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:38,054 INFO L85 PathProgramCache]: Analyzing trace with hash 237263, now seen corresponding path program 1 times [2025-03-17 11:58:38,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:38,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053807] [2025-03-17 11:58:38,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:38,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:38,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 11:58:38,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 11:58:38,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:38,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:38,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:38,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:38,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053807] [2025-03-17 11:58:38,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:38,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:38,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:58:38,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966650505] [2025-03-17 11:58:38,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:38,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:58:38,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:38,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:58:38,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:58:38,179 INFO L87 Difference]: Start difference. First operand 184 states and 196 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:38,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:38,387 INFO L93 Difference]: Finished difference Result 200 states and 215 transitions. [2025-03-17 11:58:38,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:58:38,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-03-17 11:58:38,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:38,389 INFO L225 Difference]: With dead ends: 200 [2025-03-17 11:58:38,389 INFO L226 Difference]: Without dead ends: 200 [2025-03-17 11:58:38,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:58:38,390 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 28 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:38,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 351 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:58:38,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-17 11:58:38,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 189. [2025-03-17 11:58:38,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 100 states have (on average 1.99) internal successors, (199), 185 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:38,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 203 transitions. [2025-03-17 11:58:38,399 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 203 transitions. Word has length 3 [2025-03-17 11:58:38,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:38,399 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 203 transitions. [2025-03-17 11:58:38,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:38,399 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 203 transitions. [2025-03-17 11:58:38,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 11:58:38,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:38,399 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 11:58:38,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:58:38,399 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:38,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:38,400 INFO L85 PathProgramCache]: Analyzing trace with hash 7355293, now seen corresponding path program 1 times [2025-03-17 11:58:38,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:38,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801695434] [2025-03-17 11:58:38,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:38,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:38,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 11:58:38,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 11:58:38,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:38,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:38,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:38,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:38,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801695434] [2025-03-17 11:58:38,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801695434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:38,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:38,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:58:38,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982490488] [2025-03-17 11:58:38,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:38,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:58:38,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:38,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:58:38,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:38,438 INFO L87 Difference]: Start difference. First operand 189 states and 203 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:38,529 INFO L93 Difference]: Finished difference Result 187 states and 200 transitions. [2025-03-17 11:58:38,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:58:38,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 11:58:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:38,530 INFO L225 Difference]: With dead ends: 187 [2025-03-17 11:58:38,530 INFO L226 Difference]: Without dead ends: 187 [2025-03-17 11:58:38,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:38,531 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 15 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:38,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 274 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:38,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-17 11:58:38,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-03-17 11:58:38,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 100 states have (on average 1.96) internal successors, (196), 183 states have internal predecessors, (196), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:38,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 200 transitions. [2025-03-17 11:58:38,537 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 200 transitions. Word has length 4 [2025-03-17 11:58:38,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:38,537 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 200 transitions. [2025-03-17 11:58:38,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:38,537 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 200 transitions. [2025-03-17 11:58:38,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 11:58:38,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:38,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 11:58:38,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:58:38,538 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:38,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:38,538 INFO L85 PathProgramCache]: Analyzing trace with hash 7355294, now seen corresponding path program 1 times [2025-03-17 11:58:38,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:38,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350731193] [2025-03-17 11:58:38,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:38,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:38,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 11:58:38,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 11:58:38,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:38,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:38,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:38,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:38,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350731193] [2025-03-17 11:58:38,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350731193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:38,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:38,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:58:38,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978873137] [2025-03-17 11:58:38,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:38,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:58:38,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:38,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:58:38,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:38,585 INFO L87 Difference]: Start difference. First operand 187 states and 200 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:38,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:38,681 INFO L93 Difference]: Finished difference Result 185 states and 197 transitions. [2025-03-17 11:58:38,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:58:38,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 11:58:38,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:38,682 INFO L225 Difference]: With dead ends: 185 [2025-03-17 11:58:38,682 INFO L226 Difference]: Without dead ends: 185 [2025-03-17 11:58:38,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:38,682 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 11 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:38,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 281 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:38,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-17 11:58:38,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-03-17 11:58:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 100 states have (on average 1.93) internal successors, (193), 181 states have internal predecessors, (193), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:38,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2025-03-17 11:58:38,690 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 4 [2025-03-17 11:58:38,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:38,691 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2025-03-17 11:58:38,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:38,691 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2025-03-17 11:58:38,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 11:58:38,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:38,691 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:38,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:58:38,691 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:38,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:38,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1995470934, now seen corresponding path program 1 times [2025-03-17 11:58:38,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:38,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594594448] [2025-03-17 11:58:38,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:38,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:38,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:58:38,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:58:38,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:38,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:38,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:38,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:38,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594594448] [2025-03-17 11:58:38,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594594448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:38,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:38,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:58:38,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019394949] [2025-03-17 11:58:38,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:38,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:58:38,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:38,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:58:38,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:58:38,825 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-17 11:58:38,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:38,902 INFO L93 Difference]: Finished difference Result 194 states and 207 transitions. [2025-03-17 11:58:38,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:58:38,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-17 11:58:38,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:38,903 INFO L225 Difference]: With dead ends: 194 [2025-03-17 11:58:38,903 INFO L226 Difference]: Without dead ends: 194 [2025-03-17 11:58:38,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:58:38,904 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 18 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:38,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 710 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:58:38,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-17 11:58:38,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 186. [2025-03-17 11:58:38,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 101 states have (on average 1.9207920792079207) internal successors, (194), 182 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:38,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 198 transitions. [2025-03-17 11:58:38,914 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 198 transitions. Word has length 9 [2025-03-17 11:58:38,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:38,914 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 198 transitions. [2025-03-17 11:58:38,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-17 11:58:38,916 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 198 transitions. [2025-03-17 11:58:38,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 11:58:38,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:38,916 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:38,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:58:38,917 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:38,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:38,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2102788822, now seen corresponding path program 1 times [2025-03-17 11:58:38,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:38,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912271855] [2025-03-17 11:58:38,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:38,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:38,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 11:58:38,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 11:58:38,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:38,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:38,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:38,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:38,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912271855] [2025-03-17 11:58:38,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912271855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:38,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:38,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:58:38,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275078018] [2025-03-17 11:58:38,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:38,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:58:38,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:38,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:58:38,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:58:38,995 INFO L87 Difference]: Start difference. First operand 186 states and 198 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:39,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:39,018 INFO L93 Difference]: Finished difference Result 266 states and 282 transitions. [2025-03-17 11:58:39,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:58:39,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 11:58:39,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:39,020 INFO L225 Difference]: With dead ends: 266 [2025-03-17 11:58:39,020 INFO L226 Difference]: Without dead ends: 266 [2025-03-17 11:58:39,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:58:39,020 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 84 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:39,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 560 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:58:39,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-17 11:58:39,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 230. [2025-03-17 11:58:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 144 states have (on average 1.9305555555555556) internal successors, (278), 225 states have internal predecessors, (278), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 282 transitions. [2025-03-17 11:58:39,032 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 282 transitions. Word has length 11 [2025-03-17 11:58:39,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:39,032 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 282 transitions. [2025-03-17 11:58:39,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:39,032 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 282 transitions. [2025-03-17 11:58:39,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 11:58:39,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:39,034 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:39,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:58:39,035 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:39,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:39,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2145399292, now seen corresponding path program 1 times [2025-03-17 11:58:39,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:39,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444029152] [2025-03-17 11:58:39,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:39,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:39,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 11:58:39,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 11:58:39,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:39,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:39,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:39,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:39,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444029152] [2025-03-17 11:58:39,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444029152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:39,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:39,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:58:39,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289400853] [2025-03-17 11:58:39,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:39,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:58:39,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:39,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:58:39,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:39,104 INFO L87 Difference]: Start difference. First operand 230 states and 282 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:39,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:39,206 INFO L93 Difference]: Finished difference Result 230 states and 276 transitions. [2025-03-17 11:58:39,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:58:39,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-17 11:58:39,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:39,209 INFO L225 Difference]: With dead ends: 230 [2025-03-17 11:58:39,210 INFO L226 Difference]: Without dead ends: 230 [2025-03-17 11:58:39,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:39,212 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 42 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:39,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 216 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:39,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-17 11:58:39,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 226. [2025-03-17 11:58:39,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 152 states have (on average 1.7763157894736843) internal successors, (270), 221 states have internal predecessors, (270), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:39,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 274 transitions. [2025-03-17 11:58:39,217 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 274 transitions. Word has length 13 [2025-03-17 11:58:39,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:39,217 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 274 transitions. [2025-03-17 11:58:39,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:39,217 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 274 transitions. [2025-03-17 11:58:39,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 11:58:39,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:39,218 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:39,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:58:39,218 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:39,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:39,218 INFO L85 PathProgramCache]: Analyzing trace with hash -2145399291, now seen corresponding path program 1 times [2025-03-17 11:58:39,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:39,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007124369] [2025-03-17 11:58:39,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:39,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:39,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 11:58:39,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 11:58:39,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:39,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:39,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:39,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:39,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007124369] [2025-03-17 11:58:39,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007124369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:39,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:39,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:58:39,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219459831] [2025-03-17 11:58:39,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:39,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:58:39,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:39,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:58:39,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:39,300 INFO L87 Difference]: Start difference. First operand 226 states and 274 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:39,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:39,413 INFO L93 Difference]: Finished difference Result 233 states and 270 transitions. [2025-03-17 11:58:39,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:58:39,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-17 11:58:39,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:39,414 INFO L225 Difference]: With dead ends: 233 [2025-03-17 11:58:39,414 INFO L226 Difference]: Without dead ends: 233 [2025-03-17 11:58:39,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:39,415 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 42 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:39,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 224 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:39,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-17 11:58:39,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 227. [2025-03-17 11:58:39,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 162 states have (on average 1.6296296296296295) internal successors, (264), 222 states have internal predecessors, (264), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:39,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 268 transitions. [2025-03-17 11:58:39,420 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 268 transitions. Word has length 13 [2025-03-17 11:58:39,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:39,420 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 268 transitions. [2025-03-17 11:58:39,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:39,420 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 268 transitions. [2025-03-17 11:58:39,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 11:58:39,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:39,421 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:39,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:58:39,421 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:39,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:39,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1260276838, now seen corresponding path program 1 times [2025-03-17 11:58:39,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:39,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44717085] [2025-03-17 11:58:39,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:39,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:39,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 11:58:39,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 11:58:39,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:39,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:39,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:39,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:39,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44717085] [2025-03-17 11:58:39,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44717085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:39,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:39,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:58:39,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498579077] [2025-03-17 11:58:39,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:39,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:58:39,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:39,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:58:39,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:58:39,516 INFO L87 Difference]: Start difference. First operand 227 states and 268 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:39,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:39,664 INFO L93 Difference]: Finished difference Result 280 states and 334 transitions. [2025-03-17 11:58:39,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:58:39,664 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-17 11:58:39,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:39,665 INFO L225 Difference]: With dead ends: 280 [2025-03-17 11:58:39,665 INFO L226 Difference]: Without dead ends: 280 [2025-03-17 11:58:39,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:58:39,666 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 24 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:39,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 434 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:39,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-17 11:58:39,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 235. [2025-03-17 11:58:39,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 170 states have (on average 1.6235294117647059) internal successors, (276), 230 states have internal predecessors, (276), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:39,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 280 transitions. [2025-03-17 11:58:39,670 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 280 transitions. Word has length 18 [2025-03-17 11:58:39,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:39,671 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 280 transitions. [2025-03-17 11:58:39,671 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:39,671 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 280 transitions. [2025-03-17 11:58:39,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 11:58:39,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:39,671 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:39,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:58:39,671 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:39,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:39,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1260276839, now seen corresponding path program 1 times [2025-03-17 11:58:39,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:39,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092848737] [2025-03-17 11:58:39,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:39,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:39,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 11:58:39,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 11:58:39,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:39,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:39,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:39,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:39,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092848737] [2025-03-17 11:58:39,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092848737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:39,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:39,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:58:39,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20284554] [2025-03-17 11:58:39,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:39,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:58:39,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:39,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:58:39,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:58:39,840 INFO L87 Difference]: Start difference. First operand 235 states and 280 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:40,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:40,037 INFO L93 Difference]: Finished difference Result 235 states and 276 transitions. [2025-03-17 11:58:40,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:58:40,037 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-17 11:58:40,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:40,038 INFO L225 Difference]: With dead ends: 235 [2025-03-17 11:58:40,039 INFO L226 Difference]: Without dead ends: 235 [2025-03-17 11:58:40,039 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-17 11:58:40,040 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 2 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:40,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 533 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:58:40,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-17 11:58:40,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2025-03-17 11:58:40,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 170 states have (on average 1.6) internal successors, (272), 230 states have internal predecessors, (272), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:40,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 276 transitions. [2025-03-17 11:58:40,046 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 276 transitions. Word has length 18 [2025-03-17 11:58:40,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:40,046 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 276 transitions. [2025-03-17 11:58:40,046 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:40,046 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 276 transitions. [2025-03-17 11:58:40,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 11:58:40,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:40,047 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] [2025-03-17 11:58:40,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:58:40,047 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:40,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:40,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1479315514, now seen corresponding path program 1 times [2025-03-17 11:58:40,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:40,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794483105] [2025-03-17 11:58:40,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:40,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:40,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 11:58:40,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:58:40,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:40,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:40,216 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-17 11:58:40,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:40,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794483105] [2025-03-17 11:58:40,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794483105] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:58:40,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524044211] [2025-03-17 11:58:40,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:40,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:58:40,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:58:40,218 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:58:40,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:58:40,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 11:58:40,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:58:40,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:40,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:40,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 11:58:40,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:58:40,337 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 11:58:40,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-03-17 11:58:40,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 11:58:40,436 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:58:40,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 11:58:40,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-17 11:58:40,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:58:40,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:58:40,526 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_163 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_163) c_create_data_~data~0.base) (+ c_create_data_~data~0.offset 4))) 1)) is different from false [2025-03-17 11:58:40,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:40,575 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-17 11:58:40,582 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-17 11:58:40,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2025-03-17 11:58:40,606 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-17 11:58:40,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524044211] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:58:40,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:58:40,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2025-03-17 11:58:40,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945949430] [2025-03-17 11:58:40,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:58:40,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 11:58:40,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:40,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 11:58:40,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=113, Unknown=5, NotChecked=22, Total=182 [2025-03-17 11:58:40,609 INFO L87 Difference]: Start difference. First operand 235 states and 276 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:40,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:40,813 INFO L93 Difference]: Finished difference Result 238 states and 276 transitions. [2025-03-17 11:58:40,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:58:40,813 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-17 11:58:40,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:40,814 INFO L225 Difference]: With dead ends: 238 [2025-03-17 11:58:40,814 INFO L226 Difference]: Without dead ends: 238 [2025-03-17 11:58:40,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=113, Unknown=5, NotChecked=22, Total=182 [2025-03-17 11:58:40,814 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 88 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:40,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 572 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 321 Invalid, 0 Unknown, 103 Unchecked, 0.2s Time] [2025-03-17 11:58:40,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-17 11:58:40,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2025-03-17 11:58:40,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 170 states have (on average 1.588235294117647) internal successors, (270), 229 states have internal predecessors, (270), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:40,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 274 transitions. [2025-03-17 11:58:40,818 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 274 transitions. Word has length 23 [2025-03-17 11:58:40,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:40,819 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 274 transitions. [2025-03-17 11:58:40,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:40,819 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 274 transitions. [2025-03-17 11:58:40,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 11:58:40,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:40,819 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] [2025-03-17 11:58:40,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 11:58:41,019 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-17 11:58:41,020 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:41,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:41,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1479315515, now seen corresponding path program 1 times [2025-03-17 11:58:41,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:41,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230443781] [2025-03-17 11:58:41,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:41,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:41,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 11:58:41,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:58:41,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:41,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:41,291 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-17 11:58:41,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:41,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230443781] [2025-03-17 11:58:41,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230443781] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:58:41,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861595412] [2025-03-17 11:58:41,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:41,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:58:41,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:58:41,296 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:58:41,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:58:41,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 11:58:41,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:58:41,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:41,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:41,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 11:58:41,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:58:41,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-17 11:58:41,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:58:41,395 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 10 treesize of output 8 [2025-03-17 11:58:41,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:58:41,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 11:58:41,542 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:58:41,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 11:58:41,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-17 11:58:41,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-17 11:58:41,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-17 11:58:41,622 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-17 11:58:41,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:58:41,707 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_223 (Array Int Int)) (v_ArrVal_224 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_224) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_223) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_224 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_224) c_create_data_~data~0.base) .cse1)))))) is different from false [2025-03-17 11:58:41,721 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_224 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_224) c_create_data_~data~0.base) .cse2) 4))) (forall ((v_ArrVal_223 (Array Int Int)) (v_ArrVal_224 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_224) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_223) c_create_data_~data~0.base) .cse2))))))) is different from false [2025-03-17 11:58:41,734 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_224 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_224) c_create_data_~data~0.base) .cse1) 4))) (forall ((v_ArrVal_223 (Array Int Int)) (v_ArrVal_224 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_224) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_223) c_create_data_~data~0.base) .cse1))))))) is different from false [2025-03-17 11:58:41,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:41,742 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-17 11:58:41,744 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-17 11:58:41,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:41,754 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-17 11:58:41,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:41,759 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-17 11:58:41,761 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:58:41,763 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-17 11:58:41,765 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:58:41,767 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-17 11:58:41,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-17 11:58:41,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861595412] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:58:41,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:58:41,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 21 [2025-03-17 11:58:41,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168371929] [2025-03-17 11:58:41,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:58:41,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 11:58:41,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:41,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 11:58:41,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=280, Unknown=3, NotChecked=108, Total=462 [2025-03-17 11:58:41,788 INFO L87 Difference]: Start difference. First operand 234 states and 274 transitions. Second operand has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:42,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:42,242 INFO L93 Difference]: Finished difference Result 244 states and 284 transitions. [2025-03-17 11:58:42,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:58:42,242 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-17 11:58:42,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:42,243 INFO L225 Difference]: With dead ends: 244 [2025-03-17 11:58:42,243 INFO L226 Difference]: Without dead ends: 244 [2025-03-17 11:58:42,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=368, Unknown=3, NotChecked=126, Total=600 [2025-03-17 11:58:42,244 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 10 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 265 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:42,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1241 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 755 Invalid, 0 Unknown, 265 Unchecked, 0.4s Time] [2025-03-17 11:58:42,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-17 11:58:42,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2025-03-17 11:58:42,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 180 states have (on average 1.5555555555555556) internal successors, (280), 239 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:42,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 284 transitions. [2025-03-17 11:58:42,248 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 284 transitions. Word has length 23 [2025-03-17 11:58:42,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:42,248 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 284 transitions. [2025-03-17 11:58:42,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:42,249 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 284 transitions. [2025-03-17 11:58:42,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 11:58:42,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:42,249 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:42,260 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-17 11:58:42,449 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-17 11:58:42,450 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:42,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:42,451 INFO L85 PathProgramCache]: Analyzing trace with hash 39031015, now seen corresponding path program 2 times [2025-03-17 11:58:42,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:42,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237997827] [2025-03-17 11:58:42,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:58:42,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:42,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-17 11:58:42,471 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 11:58:42,471 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:58:42,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:42,786 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:58:42,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:42,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237997827] [2025-03-17 11:58:42,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237997827] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:58:42,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275492252] [2025-03-17 11:58:42,786 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:58:42,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:58:42,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:58:42,789 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:58:42,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:58:42,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-17 11:58:42,872 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 11:58:42,872 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:58:42,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:42,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-17 11:58:42,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:58:42,883 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 10 treesize of output 8 [2025-03-17 11:58:42,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-17 11:58:42,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 11:58:42,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:58:42,978 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:58:42,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 11:58:42,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-17 11:58:43,064 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 11:58:43,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-03-17 11:58:43,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-17 11:58:43,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-17 11:58:43,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-17 11:58:43,140 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:43,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:58:43,207 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_create_data_~data~0.offset 4)) (.cse1 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_298 (Array Int Int)) (v_ArrVal_299 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_299) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_298) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_299 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_299) c_create_data_~data~0.base) .cse0) .cse1 4))))) is different from false [2025-03-17 11:58:43,224 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_299 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_299) c_create_data_~data~0.base) .cse2) 4))) (forall ((v_ArrVal_298 (Array Int Int)) (v_ArrVal_299 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_299) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_298) c_create_data_~data~0.base) .cse2))))))) is different from false [2025-03-17 11:58:43,239 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_298 (Array Int Int)) (v_ArrVal_299 (Array Int Int))) (<= (+ .cse0 12 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_299) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_298) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_299 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_299) c_create_data_~data~0.base) .cse2))))))) is different from false [2025-03-17 11:58:43,254 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse2 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_298 (Array Int Int)) (v_ArrVal_297 (Array Int Int)) (v_ArrVal_299 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_297))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (<= (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_296) .cse1 v_ArrVal_299) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_298) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_297 (Array Int Int)) (v_ArrVal_299 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem8.base| v_ArrVal_296) (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem8.base| v_ArrVal_297) c_create_data_~data~0.base) .cse2) v_ArrVal_299) c_create_data_~data~0.base) .cse2)))))) is different from false [2025-03-17 11:58:43,278 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2)) (.cse3 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_298 (Array Int Int)) (v_ArrVal_297 (Array Int Int)) (v_ArrVal_299 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_297))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_296) .cse1 v_ArrVal_299) c_create_data_~data~0.base) .cse2) .cse3 12) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_298) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_297 (Array Int Int)) (v_ArrVal_299 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_296) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_297) c_create_data_~data~0.base) .cse2) v_ArrVal_299) c_create_data_~data~0.base) .cse2) .cse3 8)))))) is different from false [2025-03-17 11:58:43,300 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_297 (Array Int Int)) (v_ArrVal_299 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_296) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_297) c_create_data_~data~0.base) .cse1) v_ArrVal_299) c_create_data_~data~0.base) .cse1) 8))) (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_298 (Array Int Int)) (v_ArrVal_297 (Array Int Int)) (v_ArrVal_299 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_297))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_296) .cse2 v_ArrVal_299) c_create_data_~data~0.base) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_298) c_create_data_~data~0.base) .cse1))))))))) is different from false [2025-03-17 11:58:43,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:43,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2025-03-17 11:58:43,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:43,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2025-03-17 11:58:43,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 400 treesize of output 334 [2025-03-17 11:58:43,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 508 treesize of output 472 [2025-03-17 11:58:43,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2025-03-17 11:58:43,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-03-17 11:58:43,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-03-17 11:58:43,361 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-17 11:58:43,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:43,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2025-03-17 11:58:43,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:43,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2025-03-17 11:58:43,384 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:58:43,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2025-03-17 11:58:43,388 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:58:43,390 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-17 11:58:43,410 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2025-03-17 11:58:43,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275492252] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:58:43,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:58:43,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 25 [2025-03-17 11:58:43,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843753853] [2025-03-17 11:58:43,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:58:43,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 11:58:43,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:43,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 11:58:43,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=311, Unknown=6, NotChecked=246, Total=650 [2025-03-17 11:58:43,413 INFO L87 Difference]: Start difference. First operand 244 states and 284 transitions. Second operand has 26 states, 25 states have (on average 2.32) internal successors, (58), 26 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:44,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:44,047 INFO L93 Difference]: Finished difference Result 257 states and 296 transitions. [2025-03-17 11:58:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:58:44,047 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.32) internal successors, (58), 26 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-17 11:58:44,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:44,048 INFO L225 Difference]: With dead ends: 257 [2025-03-17 11:58:44,049 INFO L226 Difference]: Without dead ends: 257 [2025-03-17 11:58:44,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=500, Unknown=6, NotChecked=318, Total=992 [2025-03-17 11:58:44,049 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 35 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 674 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:44,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1477 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 855 Invalid, 0 Unknown, 674 Unchecked, 0.4s Time] [2025-03-17 11:58:44,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-17 11:58:44,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 247. [2025-03-17 11:58:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 184 states have (on average 1.5326086956521738) internal successors, (282), 242 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 286 transitions. [2025-03-17 11:58:44,054 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 286 transitions. Word has length 28 [2025-03-17 11:58:44,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:44,054 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 286 transitions. [2025-03-17 11:58:44,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.32) internal successors, (58), 26 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:44,055 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 286 transitions. [2025-03-17 11:58:44,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 11:58:44,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:44,055 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:44,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 11:58:44,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:58:44,260 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:44,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:44,260 INFO L85 PathProgramCache]: Analyzing trace with hash -139186888, now seen corresponding path program 1 times [2025-03-17 11:58:44,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:44,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271270014] [2025-03-17 11:58:44,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:44,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:44,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 11:58:44,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 11:58:44,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:44,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:44,325 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:58:44,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:44,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271270014] [2025-03-17 11:58:44,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271270014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:44,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:44,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:58:44,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763904377] [2025-03-17 11:58:44,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:44,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:58:44,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:44,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:58:44,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:44,327 INFO L87 Difference]: Start difference. First operand 247 states and 286 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:44,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:44,394 INFO L93 Difference]: Finished difference Result 243 states and 274 transitions. [2025-03-17 11:58:44,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:58:44,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-17 11:58:44,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:44,395 INFO L225 Difference]: With dead ends: 243 [2025-03-17 11:58:44,395 INFO L226 Difference]: Without dead ends: 243 [2025-03-17 11:58:44,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:44,396 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 14 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:44,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 237 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:44,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-17 11:58:44,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2025-03-17 11:58:44,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 184 states have (on average 1.4673913043478262) internal successors, (270), 238 states have internal predecessors, (270), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:44,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 274 transitions. [2025-03-17 11:58:44,401 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 274 transitions. Word has length 42 [2025-03-17 11:58:44,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:44,401 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 274 transitions. [2025-03-17 11:58:44,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:44,401 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 274 transitions. [2025-03-17 11:58:44,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 11:58:44,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:44,402 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:44,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:58:44,402 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:44,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:44,402 INFO L85 PathProgramCache]: Analyzing trace with hash -139186887, now seen corresponding path program 1 times [2025-03-17 11:58:44,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:44,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128435565] [2025-03-17 11:58:44,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:44,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:44,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 11:58:44,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 11:58:44,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:44,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:44,486 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:58:44,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:44,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128435565] [2025-03-17 11:58:44,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128435565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:44,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:44,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:58:44,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756740179] [2025-03-17 11:58:44,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:44,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:58:44,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:44,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:58:44,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:44,488 INFO L87 Difference]: Start difference. First operand 243 states and 274 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:44,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:44,564 INFO L93 Difference]: Finished difference Result 239 states and 262 transitions. [2025-03-17 11:58:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:58:44,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-17 11:58:44,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:44,565 INFO L225 Difference]: With dead ends: 239 [2025-03-17 11:58:44,566 INFO L226 Difference]: Without dead ends: 239 [2025-03-17 11:58:44,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:44,566 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 14 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:44,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 236 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:44,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-17 11:58:44,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2025-03-17 11:58:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 184 states have (on average 1.4021739130434783) internal successors, (258), 234 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 262 transitions. [2025-03-17 11:58:44,571 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 262 transitions. Word has length 42 [2025-03-17 11:58:44,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:44,571 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 262 transitions. [2025-03-17 11:58:44,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:44,571 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 262 transitions. [2025-03-17 11:58:44,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 11:58:44,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:44,573 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:44,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:58:44,573 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:44,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:44,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1874708094, now seen corresponding path program 1 times [2025-03-17 11:58:44,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:44,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400933189] [2025-03-17 11:58:44,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:44,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:44,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 11:58:44,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 11:58:44,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:44,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:58:44,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:44,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400933189] [2025-03-17 11:58:44,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400933189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:44,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:44,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:58:44,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493146051] [2025-03-17 11:58:44,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:44,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:58:44,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:44,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:58:44,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:58:44,806 INFO L87 Difference]: Start difference. First operand 239 states and 262 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:58:45,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:45,055 INFO L93 Difference]: Finished difference Result 249 states and 274 transitions. [2025-03-17 11:58:45,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:58:45,056 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2025-03-17 11:58:45,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:45,057 INFO L225 Difference]: With dead ends: 249 [2025-03-17 11:58:45,057 INFO L226 Difference]: Without dead ends: 249 [2025-03-17 11:58:45,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:58:45,057 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 45 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:45,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 430 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:58:45,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-17 11:58:45,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 247. [2025-03-17 11:58:45,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 190 states have (on average 1.4) internal successors, (266), 240 states have internal predecessors, (266), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:58:45,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 272 transitions. [2025-03-17 11:58:45,061 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 272 transitions. Word has length 45 [2025-03-17 11:58:45,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:45,062 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 272 transitions. [2025-03-17 11:58:45,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:58:45,062 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 272 transitions. [2025-03-17 11:58:45,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 11:58:45,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:45,062 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:45,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:58:45,063 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:45,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:45,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1874708093, now seen corresponding path program 1 times [2025-03-17 11:58:45,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:45,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298960104] [2025-03-17 11:58:45,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:45,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:45,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 11:58:45,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 11:58:45,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:45,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:45,374 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:58:45,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:45,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298960104] [2025-03-17 11:58:45,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298960104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:45,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:45,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:58:45,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824366010] [2025-03-17 11:58:45,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:45,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:58:45,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:45,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:58:45,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:58:45,376 INFO L87 Difference]: Start difference. First operand 247 states and 272 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:58:45,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:45,758 INFO L93 Difference]: Finished difference Result 255 states and 278 transitions. [2025-03-17 11:58:45,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:58:45,759 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2025-03-17 11:58:45,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:45,759 INFO L225 Difference]: With dead ends: 255 [2025-03-17 11:58:45,759 INFO L226 Difference]: Without dead ends: 255 [2025-03-17 11:58:45,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:58:45,760 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 35 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:45,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 598 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:58:45,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-17 11:58:45,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 247. [2025-03-17 11:58:45,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 190 states have (on average 1.3894736842105264) internal successors, (264), 240 states have internal predecessors, (264), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:58:45,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 270 transitions. [2025-03-17 11:58:45,764 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 270 transitions. Word has length 45 [2025-03-17 11:58:45,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:45,764 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 270 transitions. [2025-03-17 11:58:45,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:58:45,765 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 270 transitions. [2025-03-17 11:58:45,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 11:58:45,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:45,765 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:45,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:58:45,765 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:45,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:45,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2003176545, now seen corresponding path program 1 times [2025-03-17 11:58:45,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:45,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92818176] [2025-03-17 11:58:45,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:45,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:45,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 11:58:45,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 11:58:45,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:45,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:45,947 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:58:45,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:45,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92818176] [2025-03-17 11:58:45,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92818176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:45,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:45,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:58:45,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942047605] [2025-03-17 11:58:45,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:45,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:58:45,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:45,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:58:45,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:58:45,949 INFO L87 Difference]: Start difference. First operand 247 states and 270 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:58:46,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:46,172 INFO L93 Difference]: Finished difference Result 252 states and 276 transitions. [2025-03-17 11:58:46,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:58:46,173 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-03-17 11:58:46,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:46,174 INFO L225 Difference]: With dead ends: 252 [2025-03-17 11:58:46,174 INFO L226 Difference]: Without dead ends: 252 [2025-03-17 11:58:46,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:58:46,174 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 40 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:46,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 439 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:58:46,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-17 11:58:46,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2025-03-17 11:58:46,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 193 states have (on average 1.38860103626943) internal successors, (268), 243 states have internal predecessors, (268), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:58:46,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 274 transitions. [2025-03-17 11:58:46,178 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 274 transitions. Word has length 47 [2025-03-17 11:58:46,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:46,178 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 274 transitions. [2025-03-17 11:58:46,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:58:46,178 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 274 transitions. [2025-03-17 11:58:46,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 11:58:46,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:46,179 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:46,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:58:46,179 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:46,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:46,179 INFO L85 PathProgramCache]: Analyzing trace with hash -2003176544, now seen corresponding path program 1 times [2025-03-17 11:58:46,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:46,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283797628] [2025-03-17 11:58:46,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:46,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:46,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 11:58:46,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 11:58:46,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:46,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:46,551 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:58:46,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:46,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283797628] [2025-03-17 11:58:46,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283797628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:46,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:46,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:58:46,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274504312] [2025-03-17 11:58:46,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:46,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:58:46,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:46,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:58:46,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:58:46,553 INFO L87 Difference]: Start difference. First operand 250 states and 274 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:58:46,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:46,993 INFO L93 Difference]: Finished difference Result 254 states and 277 transitions. [2025-03-17 11:58:46,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:58:46,993 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-03-17 11:58:46,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:46,994 INFO L225 Difference]: With dead ends: 254 [2025-03-17 11:58:46,994 INFO L226 Difference]: Without dead ends: 254 [2025-03-17 11:58:46,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:58:46,995 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 131 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:46,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 529 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:58:46,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-17 11:58:46,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 249. [2025-03-17 11:58:46,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 193 states have (on average 1.378238341968912) internal successors, (266), 242 states have internal predecessors, (266), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:58:47,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 272 transitions. [2025-03-17 11:58:47,000 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 272 transitions. Word has length 47 [2025-03-17 11:58:47,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:47,000 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 272 transitions. [2025-03-17 11:58:47,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:58:47,001 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 272 transitions. [2025-03-17 11:58:47,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 11:58:47,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:47,002 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:47,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:58:47,002 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:47,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:47,002 INFO L85 PathProgramCache]: Analyzing trace with hash -907306500, now seen corresponding path program 1 times [2025-03-17 11:58:47,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:47,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932974325] [2025-03-17 11:58:47,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:47,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:47,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:58:47,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:58:47,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:47,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:58:47,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:47,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932974325] [2025-03-17 11:58:47,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932974325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:47,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:47,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:58:47,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525342601] [2025-03-17 11:58:47,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:47,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:58:47,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:47,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:58:47,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:58:47,094 INFO L87 Difference]: Start difference. First operand 249 states and 272 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:58:47,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:47,184 INFO L93 Difference]: Finished difference Result 248 states and 271 transitions. [2025-03-17 11:58:47,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:58:47,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-17 11:58:47,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:47,186 INFO L225 Difference]: With dead ends: 248 [2025-03-17 11:58:47,186 INFO L226 Difference]: Without dead ends: 248 [2025-03-17 11:58:47,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:58:47,186 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 69 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:47,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 265 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:47,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-17 11:58:47,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2025-03-17 11:58:47,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 193 states have (on average 1.3730569948186528) internal successors, (265), 241 states have internal predecessors, (265), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:58:47,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 271 transitions. [2025-03-17 11:58:47,190 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 271 transitions. Word has length 49 [2025-03-17 11:58:47,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:47,191 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 271 transitions. [2025-03-17 11:58:47,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:58:47,191 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 271 transitions. [2025-03-17 11:58:47,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 11:58:47,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:47,191 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:47,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:58:47,191 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:47,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:47,192 INFO L85 PathProgramCache]: Analyzing trace with hash -907306499, now seen corresponding path program 1 times [2025-03-17 11:58:47,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:47,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96070013] [2025-03-17 11:58:47,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:47,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:47,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:58:47,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:58:47,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:47,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:47,303 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:58:47,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:47,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96070013] [2025-03-17 11:58:47,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96070013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:47,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:47,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:58:47,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676637889] [2025-03-17 11:58:47,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:47,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:58:47,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:47,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:58:47,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:58:47,305 INFO L87 Difference]: Start difference. First operand 248 states and 271 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:58:47,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:47,409 INFO L93 Difference]: Finished difference Result 240 states and 263 transitions. [2025-03-17 11:58:47,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:58:47,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-17 11:58:47,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:47,411 INFO L225 Difference]: With dead ends: 240 [2025-03-17 11:58:47,411 INFO L226 Difference]: Without dead ends: 240 [2025-03-17 11:58:47,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:58:47,413 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 141 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:47,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 364 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:47,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-17 11:58:47,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2025-03-17 11:58:47,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 193 states have (on average 1.3316062176165804) internal successors, (257), 233 states have internal predecessors, (257), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:58:47,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 263 transitions. [2025-03-17 11:58:47,418 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 263 transitions. Word has length 49 [2025-03-17 11:58:47,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:47,418 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 263 transitions. [2025-03-17 11:58:47,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:58:47,419 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 263 transitions. [2025-03-17 11:58:47,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 11:58:47,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:47,419 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:47,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:58:47,419 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:47,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:47,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1938269711, now seen corresponding path program 1 times [2025-03-17 11:58:47,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:47,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391533350] [2025-03-17 11:58:47,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:47,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:47,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:58:47,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:58:47,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:47,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:47,557 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:58:47,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:47,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391533350] [2025-03-17 11:58:47,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391533350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:47,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:47,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:58:47,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214665888] [2025-03-17 11:58:47,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:47,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:58:47,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:47,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:58:47,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:58:47,558 INFO L87 Difference]: Start difference. First operand 240 states and 263 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:58:47,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:47,695 INFO L93 Difference]: Finished difference Result 262 states and 288 transitions. [2025-03-17 11:58:47,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:58:47,696 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-03-17 11:58:47,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:47,696 INFO L225 Difference]: With dead ends: 262 [2025-03-17 11:58:47,697 INFO L226 Difference]: Without dead ends: 262 [2025-03-17 11:58:47,697 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-17 11:58:47,697 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 72 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:47,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 370 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:47,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-17 11:58:47,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 239. [2025-03-17 11:58:47,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 193 states have (on average 1.3264248704663213) internal successors, (256), 232 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:58:47,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 262 transitions. [2025-03-17 11:58:47,701 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 262 transitions. Word has length 50 [2025-03-17 11:58:47,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:47,702 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 262 transitions. [2025-03-17 11:58:47,702 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:58:47,702 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 262 transitions. [2025-03-17 11:58:47,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 11:58:47,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:47,702 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:47,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:58:47,702 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:47,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:47,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1938269712, now seen corresponding path program 1 times [2025-03-17 11:58:47,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:47,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93048876] [2025-03-17 11:58:47,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:47,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:47,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:58:47,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:58:47,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:47,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:47,930 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:58:47,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:47,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93048876] [2025-03-17 11:58:47,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93048876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:47,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:47,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:58:47,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266592480] [2025-03-17 11:58:47,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:47,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:58:47,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:47,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:58:47,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:58:47,933 INFO L87 Difference]: Start difference. First operand 239 states and 262 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:58:48,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:48,095 INFO L93 Difference]: Finished difference Result 275 states and 303 transitions. [2025-03-17 11:58:48,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:58:48,096 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-03-17 11:58:48,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:48,097 INFO L225 Difference]: With dead ends: 275 [2025-03-17 11:58:48,097 INFO L226 Difference]: Without dead ends: 275 [2025-03-17 11:58:48,097 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-17 11:58:48,097 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 83 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:48,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 374 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:48,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-17 11:58:48,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 238. [2025-03-17 11:58:48,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 193 states have (on average 1.3212435233160622) internal successors, (255), 231 states have internal predecessors, (255), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:58:48,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 261 transitions. [2025-03-17 11:58:48,104 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 261 transitions. Word has length 50 [2025-03-17 11:58:48,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:48,104 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 261 transitions. [2025-03-17 11:58:48,104 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:58:48,104 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 261 transitions. [2025-03-17 11:58:48,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 11:58:48,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:48,105 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:48,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:58:48,105 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:48,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:48,106 INFO L85 PathProgramCache]: Analyzing trace with hash 2086195434, now seen corresponding path program 1 times [2025-03-17 11:58:48,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:48,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398556326] [2025-03-17 11:58:48,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:48,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:48,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 11:58:48,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 11:58:48,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:48,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:48,174 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:58:48,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:48,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398556326] [2025-03-17 11:58:48,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398556326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:48,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:48,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:58:48,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543828142] [2025-03-17 11:58:48,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:48,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:58:48,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:48,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:58:48,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:58:48,176 INFO L87 Difference]: Start difference. First operand 238 states and 261 transitions. Second operand has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:58:48,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:48,297 INFO L93 Difference]: Finished difference Result 260 states and 286 transitions. [2025-03-17 11:58:48,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:58:48,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-03-17 11:58:48,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:48,299 INFO L225 Difference]: With dead ends: 260 [2025-03-17 11:58:48,299 INFO L226 Difference]: Without dead ends: 260 [2025-03-17 11:58:48,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:58:48,300 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 44 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:48,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 396 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:48,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-17 11:58:48,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 237. [2025-03-17 11:58:48,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 193 states have (on average 1.3160621761658031) internal successors, (254), 230 states have internal predecessors, (254), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:58:48,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 260 transitions. [2025-03-17 11:58:48,305 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 260 transitions. Word has length 54 [2025-03-17 11:58:48,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:48,305 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 260 transitions. [2025-03-17 11:58:48,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:58:48,305 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 260 transitions. [2025-03-17 11:58:48,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 11:58:48,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:48,306 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:48,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 11:58:48,306 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:48,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:48,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2086195435, now seen corresponding path program 1 times [2025-03-17 11:58:48,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:48,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056318053] [2025-03-17 11:58:48,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:48,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:48,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 11:58:48,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 11:58:48,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:48,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:58:48,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:48,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056318053] [2025-03-17 11:58:48,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056318053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:48,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:48,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:58:48,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306176113] [2025-03-17 11:58:48,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:48,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:58:48,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:48,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:58:48,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:58:48,426 INFO L87 Difference]: Start difference. First operand 237 states and 260 transitions. Second operand has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:58:48,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:48,547 INFO L93 Difference]: Finished difference Result 272 states and 298 transitions. [2025-03-17 11:58:48,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:58:48,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-03-17 11:58:48,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:48,548 INFO L225 Difference]: With dead ends: 272 [2025-03-17 11:58:48,548 INFO L226 Difference]: Without dead ends: 272 [2025-03-17 11:58:48,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:58:48,549 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 47 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:48,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 408 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:48,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-17 11:58:48,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 236. [2025-03-17 11:58:48,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 193 states have (on average 1.310880829015544) internal successors, (253), 229 states have internal predecessors, (253), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:58:48,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 259 transitions. [2025-03-17 11:58:48,570 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 259 transitions. Word has length 54 [2025-03-17 11:58:48,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:48,570 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 259 transitions. [2025-03-17 11:58:48,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:58:48,570 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 259 transitions. [2025-03-17 11:58:48,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 11:58:48,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:48,571 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:48,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 11:58:48,571 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:48,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:48,571 INFO L85 PathProgramCache]: Analyzing trace with hash 247549141, now seen corresponding path program 1 times [2025-03-17 11:58:48,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:48,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623734758] [2025-03-17 11:58:48,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:48,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:48,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 11:58:48,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 11:58:48,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:48,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:48,835 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:58:48,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:48,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623734758] [2025-03-17 11:58:48,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623734758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:48,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:48,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:58:48,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512601704] [2025-03-17 11:58:48,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:48,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:58:48,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:48,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:58:48,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:58:48,836 INFO L87 Difference]: Start difference. First operand 236 states and 259 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:58:49,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:49,129 INFO L93 Difference]: Finished difference Result 277 states and 304 transitions. [2025-03-17 11:58:49,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:58:49,129 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-17 11:58:49,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:49,130 INFO L225 Difference]: With dead ends: 277 [2025-03-17 11:58:49,130 INFO L226 Difference]: Without dead ends: 277 [2025-03-17 11:58:49,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:58:49,131 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 63 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:49,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 604 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:58:49,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-17 11:58:49,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 245. [2025-03-17 11:58:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 202 states have (on average 1.306930693069307) internal successors, (264), 238 states have internal predecessors, (264), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:58:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 270 transitions. [2025-03-17 11:58:49,135 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 270 transitions. Word has length 55 [2025-03-17 11:58:49,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:49,135 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 270 transitions. [2025-03-17 11:58:49,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:58:49,135 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 270 transitions. [2025-03-17 11:58:49,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 11:58:49,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:49,136 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:49,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 11:58:49,136 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:49,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:49,136 INFO L85 PathProgramCache]: Analyzing trace with hash 247549142, now seen corresponding path program 1 times [2025-03-17 11:58:49,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:49,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234251286] [2025-03-17 11:58:49,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:49,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:49,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 11:58:49,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 11:58:49,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:49,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:49,508 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:58:49,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:49,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234251286] [2025-03-17 11:58:49,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234251286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:49,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:49,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 11:58:49,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546521737] [2025-03-17 11:58:49,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:49,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:58:49,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:49,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:58:49,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:58:49,510 INFO L87 Difference]: Start difference. First operand 245 states and 270 transitions. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:58:49,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:49,760 INFO L93 Difference]: Finished difference Result 288 states and 317 transitions. [2025-03-17 11:58:49,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:58:49,760 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-17 11:58:49,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:49,761 INFO L225 Difference]: With dead ends: 288 [2025-03-17 11:58:49,761 INFO L226 Difference]: Without dead ends: 288 [2025-03-17 11:58:49,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:58:49,762 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 109 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:49,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 609 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:58:49,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-17 11:58:49,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 245. [2025-03-17 11:58:49,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 202 states have (on average 1.301980198019802) internal successors, (263), 238 states have internal predecessors, (263), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:58:49,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 269 transitions. [2025-03-17 11:58:49,768 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 269 transitions. Word has length 55 [2025-03-17 11:58:49,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:49,769 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 269 transitions. [2025-03-17 11:58:49,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:58:49,769 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 269 transitions. [2025-03-17 11:58:49,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 11:58:49,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:49,769 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-03-17 11:58:49,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 11:58:49,769 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting create_dataErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:49,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:49,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1269554157, now seen corresponding path program 1 times [2025-03-17 11:58:49,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:49,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902280772] [2025-03-17 11:58:49,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:49,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:49,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 11:58:49,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 11:58:49,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:49,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:58:49,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:49,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902280772] [2025-03-17 11:58:49,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902280772] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:58:49,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798961567] [2025-03-17 11:58:49,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:49,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:58:49,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:58:49,868 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:58:49,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:58:49,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 11:58:50,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 11:58:50,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:50,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:50,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 11:58:50,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:58:50,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:58:50,058 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 11:58:50,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-17 11:58:50,066 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:58:50,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:58:50,093 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:58:50,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798961567] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:58:50,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:58:50,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2025-03-17 11:58:50,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046144581] [2025-03-17 11:58:50,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:58:50,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:58:50,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:50,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:58:50,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:58:50,094 INFO L87 Difference]: Start difference. First operand 245 states and 269 transitions. Second operand has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:50,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:50,207 INFO L93 Difference]: Finished difference Result 244 states and 267 transitions. [2025-03-17 11:58:50,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:58:50,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-17 11:58:50,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:50,209 INFO L225 Difference]: With dead ends: 244 [2025-03-17 11:58:50,209 INFO L226 Difference]: Without dead ends: 244 [2025-03-17 11:58:50,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:58:50,210 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 38 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:50,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 303 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:50,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-17 11:58:50,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2025-03-17 11:58:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 202 states have (on average 1.2920792079207921) internal successors, (261), 237 states have internal predecessors, (261), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:58:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 267 transitions. [2025-03-17 11:58:50,217 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 267 transitions. Word has length 55 [2025-03-17 11:58:50,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:50,217 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 267 transitions. [2025-03-17 11:58:50,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:50,217 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 267 transitions. [2025-03-17 11:58:50,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 11:58:50,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:50,217 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-03-17 11:58:50,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 11:58:50,417 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,SelfDestructingSolverStorable28 [2025-03-17 11:58:50,418 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting create_dataErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:50,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:50,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1269554156, now seen corresponding path program 1 times [2025-03-17 11:58:50,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:50,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761207782] [2025-03-17 11:58:50,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:50,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:50,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 11:58:50,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 11:58:50,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:50,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:50,587 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:58:50,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:50,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761207782] [2025-03-17 11:58:50,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761207782] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:58:50,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948422111] [2025-03-17 11:58:50,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:50,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:58:50,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:58:50,590 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:58:50,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 11:58:50,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 11:58:50,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 11:58:50,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:50,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:50,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 11:58:50,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:58:50,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:58:50,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:58:50,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:58:50,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 11:58:50,843 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:58:50,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:58:50,854 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:58:50,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:58:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:58:51,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948422111] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:58:51,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:58:51,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2025-03-17 11:58:51,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20039917] [2025-03-17 11:58:51,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:58:51,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 11:58:51,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:51,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 11:58:51,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:58:51,060 INFO L87 Difference]: Start difference. First operand 244 states and 267 transitions. Second operand has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 12 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:51,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:51,287 INFO L93 Difference]: Finished difference Result 240 states and 259 transitions. [2025-03-17 11:58:51,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:58:51,288 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 12 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-17 11:58:51,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:51,289 INFO L225 Difference]: With dead ends: 240 [2025-03-17 11:58:51,289 INFO L226 Difference]: Without dead ends: 240 [2025-03-17 11:58:51,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:58:51,289 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 173 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:51,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 505 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:58:51,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-17 11:58:51,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 226. [2025-03-17 11:58:51,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 188 states have (on average 1.2712765957446808) internal successors, (239), 219 states have internal predecessors, (239), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:58:51,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 245 transitions. [2025-03-17 11:58:51,293 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 245 transitions. Word has length 55 [2025-03-17 11:58:51,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:51,293 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 245 transitions. [2025-03-17 11:58:51,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 12 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:51,293 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 245 transitions. [2025-03-17 11:58:51,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 11:58:51,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:51,294 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:51,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 11:58:51,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:58:51,498 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-03-17 11:58:51,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:51,498 INFO L85 PathProgramCache]: Analyzing trace with hash -272392490, now seen corresponding path program 1 times [2025-03-17 11:58:51,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:51,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463148012] [2025-03-17 11:58:51,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:51,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:51,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:58:51,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:58:51,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:51,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:51,978 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 11:58:51,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:51,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463148012] [2025-03-17 11:58:51,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463148012] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:58:51,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557840883] [2025-03-17 11:58:51,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:51,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:58:51,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:58:51,981 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:58:51,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 11:58:52,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:58:52,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:58:52,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:52,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:52,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 11:58:52,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:58:52,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:58:52,740 INFO L349 Elim1Store]: treesize reduction 181, result has 16.6 percent of original size [2025-03-17 11:58:52,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 165 [2025-03-17 11:58:53,657 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:58:54,258 INFO L349 Elim1Store]: treesize reduction 636, result has 10.2 percent of original size [2025-03-17 11:58:54,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 26 case distinctions, treesize of input 90440753 treesize of output 58721421