./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test01-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:42:46,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:42:46,921 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:42:46,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:42:46,926 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:42:46,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:42:46,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:42:46,952 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:42:46,952 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:42:46,952 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:42:46,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:42:46,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:42:46,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:42:46,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:42:46,953 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:42:46,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:42:46,954 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:42:46,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:42:46,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:42:46,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:42:46,954 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:42:46,954 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:42:46,954 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:42:46,954 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:42:46,954 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:42:46,955 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:42:46,955 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:42:46,955 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:42:46,955 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:42:46,955 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:42:46,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:42:46,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:42:46,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:42:46,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:42:46,956 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:42:46,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:42:46,956 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:42:46,956 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:42:46,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:42:46,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:42:46,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:42:46,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:42:46,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:42:46,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:42:46,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:42:46,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:42:46,957 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 -> 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df [2025-04-30 10:42:47,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:42:47,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:42:47,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:42:47,165 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:42:47,166 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:42:47,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test01-1.i [2025-04-30 10:42:48,429 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5df1a916a/5f64012861664d3cbfbf69aaa4b41fb9/FLAG0da7eb658 [2025-04-30 10:42:48,670 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:42:48,671 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test01-1.i [2025-04-30 10:42:48,683 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5df1a916a/5f64012861664d3cbfbf69aaa4b41fb9/FLAG0da7eb658 [2025-04-30 10:42:49,429 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5df1a916a/5f64012861664d3cbfbf69aaa4b41fb9 [2025-04-30 10:42:49,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:42:49,432 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:42:49,433 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:42:49,433 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:42:49,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:42:49,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:42:49" (1/1) ... [2025-04-30 10:42:49,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5df9e559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:49, skipping insertion in model container [2025-04-30 10:42:49,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:42:49" (1/1) ... [2025-04-30 10:42:49,455 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:42:49,672 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-30 10:42:49,691 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:42:49,702 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:42:49,769 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:42:49,794 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:42:49,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:49 WrapperNode [2025-04-30 10:42:49,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:42:49,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:42:49,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:42:49,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:42:49,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:49" (1/1) ... [2025-04-30 10:42:49,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:49" (1/1) ... [2025-04-30 10:42:49,839 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102 [2025-04-30 10:42:49,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:42:49,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:42:49,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:42:49,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:42:49,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:49" (1/1) ... [2025-04-30 10:42:49,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:49" (1/1) ... [2025-04-30 10:42:49,854 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:49" (1/1) ... [2025-04-30 10:42:49,887 INFO L175 MemorySlicer]: Split 44 memory accesses to 3 slices as follows [2, 11, 31]. 70 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 18 writes are split as follows [0, 2, 16]. [2025-04-30 10:42:49,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:49" (1/1) ... [2025-04-30 10:42:49,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:49" (1/1) ... [2025-04-30 10:42:49,902 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:49" (1/1) ... [2025-04-30 10:42:49,903 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:49" (1/1) ... [2025-04-30 10:42:49,910 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:49" (1/1) ... [2025-04-30 10:42:49,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:49" (1/1) ... [2025-04-30 10:42:49,916 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:49" (1/1) ... [2025-04-30 10:42:49,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:42:49,924 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:42:49,924 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:42:49,924 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:42:49,925 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:49" (1/1) ... [2025-04-30 10:42:49,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:42:49,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:49,953 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-04-30 10:42:49,956 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-04-30 10:42:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:42:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:42:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-30 10:42:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:42:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:42:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:42:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:42:49,979 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2025-04-30 10:42:49,979 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2025-04-30 10:42:49,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:42:49,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:42:49,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:42:49,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:42:49,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:42:49,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:42:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:42:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:42:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:42:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:42:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:42:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-30 10:42:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:42:49,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:42:49,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:42:49,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:42:49,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:42:50,092 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:42:50,094 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:42:50,493 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2025-04-30 10:42:50,493 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:42:50,508 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:42:50,511 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-30 10:42:50,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:42:50 BoogieIcfgContainer [2025-04-30 10:42:50,512 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:42:50,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:42:50,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:42:50,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:42:50,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:42:49" (1/3) ... [2025-04-30 10:42:50,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a927df2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:42:50, skipping insertion in model container [2025-04-30 10:42:50,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:42:49" (2/3) ... [2025-04-30 10:42:50,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a927df2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:42:50, skipping insertion in model container [2025-04-30 10:42:50,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:42:50" (3/3) ... [2025-04-30 10:42:50,520 INFO L128 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2025-04-30 10:42:50,531 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:42:50,532 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG complex_data_creation_test01-1.i that has 2 procedures, 193 locations, 210 edges, 1 initial locations, 4 loop locations, and 92 error locations. [2025-04-30 10:42:50,569 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:42:50,578 INFO L340 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;@10d0da42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:42:50,578 INFO L341 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2025-04-30 10:42:50,582 INFO L278 IsEmpty]: Start isEmpty. Operand has 193 states, 97 states have (on average 2.1030927835051547) internal successors, (204), 189 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-04-30 10:42:50,585 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-30 10:42:50,585 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:50,586 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-30 10:42:50,586 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:42:50,589 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:50,589 INFO L85 PathProgramCache]: Analyzing trace with hash 4742853, now seen corresponding path program 1 times [2025-04-30 10:42:50,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:50,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088831659] [2025-04-30 10:42:50,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:50,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:50,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-30 10:42:50,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-30 10:42:50,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:50,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:50,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:50,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:50,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088831659] [2025-04-30 10:42:50,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088831659] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:50,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:50,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:42:50,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175922179] [2025-04-30 10:42:50,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:50,830 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:42:50,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:50,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:42:50,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:42:50,850 INFO L87 Difference]: Start difference. First operand has 193 states, 97 states have (on average 2.1030927835051547) internal successors, (204), 189 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:51,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:51,121 INFO L93 Difference]: Finished difference Result 187 states and 199 transitions. [2025-04-30 10:42:51,123 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:42:51,124 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-04-30 10:42:51,124 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:51,132 INFO L225 Difference]: With dead ends: 187 [2025-04-30 10:42:51,132 INFO L226 Difference]: Without dead ends: 185 [2025-04-30 10:42:51,134 INFO L436 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-04-30 10:42:51,135 INFO L437 NwaCegarLoop]: 163 mSDtfsCounter, 76 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:51,135 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 316 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:42:51,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-04-30 10:42:51,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-04-30 10:42:51,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 96 states have (on average 2.0104166666666665) 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-04-30 10:42:51,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2025-04-30 10:42:51,178 INFO L79 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 4 [2025-04-30 10:42:51,178 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:51,178 INFO L485 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2025-04-30 10:42:51,179 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:51,179 INFO L278 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2025-04-30 10:42:51,179 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-30 10:42:51,179 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:51,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-30 10:42:51,179 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:42:51,179 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:42:51,180 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:51,180 INFO L85 PathProgramCache]: Analyzing trace with hash 4742854, now seen corresponding path program 1 times [2025-04-30 10:42:51,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:51,181 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466297700] [2025-04-30 10:42:51,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:51,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:51,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-30 10:42:51,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-30 10:42:51,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:51,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:51,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:51,339 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466297700] [2025-04-30 10:42:51,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466297700] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:51,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:51,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:42:51,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349970864] [2025-04-30 10:42:51,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:51,339 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:42:51,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:51,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:42:51,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:42:51,340 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:51,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:51,557 INFO L93 Difference]: Finished difference Result 201 states and 216 transitions. [2025-04-30 10:42:51,558 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:42:51,558 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-04-30 10:42:51,559 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:51,561 INFO L225 Difference]: With dead ends: 201 [2025-04-30 10:42:51,561 INFO L226 Difference]: Without dead ends: 201 [2025-04-30 10:42:51,562 INFO L436 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-04-30 10:42:51,562 INFO L437 NwaCegarLoop]: 185 mSDtfsCounter, 28 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:51,562 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 352 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:42:51,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-04-30 10:42:51,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 190. [2025-04-30 10:42:51,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 101 states have (on average 1.9801980198019802) internal successors, (200), 186 states have internal predecessors, (200), 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-04-30 10:42:51,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 204 transitions. [2025-04-30 10:42:51,574 INFO L79 Accepts]: Start accepts. Automaton has 190 states and 204 transitions. Word has length 4 [2025-04-30 10:42:51,575 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:51,575 INFO L485 AbstractCegarLoop]: Abstraction has 190 states and 204 transitions. [2025-04-30 10:42:51,575 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:51,575 INFO L278 IsEmpty]: Start isEmpty. Operand 190 states and 204 transitions. [2025-04-30 10:42:51,575 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-30 10:42:51,575 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:51,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:42:51,575 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:42:51,575 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:42:51,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:51,576 INFO L85 PathProgramCache]: Analyzing trace with hash 147028547, now seen corresponding path program 1 times [2025-04-30 10:42:51,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:51,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816824288] [2025-04-30 10:42:51,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:51,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:51,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:42:51,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:42:51,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:51,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:51,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:51,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:51,623 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816824288] [2025-04-30 10:42:51,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816824288] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:51,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:51,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:42:51,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267450348] [2025-04-30 10:42:51,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:51,623 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:42:51,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:51,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:42:51,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:42:51,624 INFO L87 Difference]: Start difference. First operand 190 states and 204 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:51,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:51,728 INFO L93 Difference]: Finished difference Result 188 states and 201 transitions. [2025-04-30 10:42:51,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:42:51,728 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-30 10:42:51,729 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:51,729 INFO L225 Difference]: With dead ends: 188 [2025-04-30 10:42:51,729 INFO L226 Difference]: Without dead ends: 188 [2025-04-30 10:42:51,729 INFO L436 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-04-30 10:42:51,730 INFO L437 NwaCegarLoop]: 185 mSDtfsCounter, 15 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:51,730 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 275 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:51,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-04-30 10:42:51,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-04-30 10:42:51,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 101 states have (on average 1.9504950495049505) internal successors, (197), 184 states have internal predecessors, (197), 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-04-30 10:42:51,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2025-04-30 10:42:51,736 INFO L79 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 5 [2025-04-30 10:42:51,736 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:51,736 INFO L485 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2025-04-30 10:42:51,736 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:51,736 INFO L278 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2025-04-30 10:42:51,736 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-30 10:42:51,737 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:51,737 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:42:51,737 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:42:51,737 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:42:51,737 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:51,737 INFO L85 PathProgramCache]: Analyzing trace with hash 147028548, now seen corresponding path program 1 times [2025-04-30 10:42:51,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:51,737 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585345777] [2025-04-30 10:42:51,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:51,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:51,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:42:51,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:42:51,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:51,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:51,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:51,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:51,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585345777] [2025-04-30 10:42:51,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585345777] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:51,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:51,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:42:51,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147004380] [2025-04-30 10:42:51,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:51,820 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:42:51,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:51,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:42:51,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:42:51,820 INFO L87 Difference]: Start difference. First operand 188 states and 201 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:51,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:51,916 INFO L93 Difference]: Finished difference Result 186 states and 198 transitions. [2025-04-30 10:42:51,916 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:42:51,916 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-30 10:42:51,916 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:51,917 INFO L225 Difference]: With dead ends: 186 [2025-04-30 10:42:51,917 INFO L226 Difference]: Without dead ends: 186 [2025-04-30 10:42:51,917 INFO L436 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-04-30 10:42:51,918 INFO L437 NwaCegarLoop]: 185 mSDtfsCounter, 11 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:51,918 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 282 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:51,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-04-30 10:42:51,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-04-30 10:42:51,923 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-04-30 10:42:51,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 198 transitions. [2025-04-30 10:42:51,924 INFO L79 Accepts]: Start accepts. Automaton has 186 states and 198 transitions. Word has length 5 [2025-04-30 10:42:51,924 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:51,924 INFO L485 AbstractCegarLoop]: Abstraction has 186 states and 198 transitions. [2025-04-30 10:42:51,924 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:51,924 INFO L278 IsEmpty]: Start isEmpty. Operand 186 states and 198 transitions. [2025-04-30 10:42:51,924 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:42:51,924 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:51,924 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:51,925 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:42:51,925 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:42:51,925 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:51,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1597754313, now seen corresponding path program 1 times [2025-04-30 10:42:51,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:51,925 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897113026] [2025-04-30 10:42:51,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:51,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:51,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:42:51,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:42:51,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:51,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:52,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:52,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:52,022 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897113026] [2025-04-30 10:42:52,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897113026] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:52,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:52,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:42:52,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581786333] [2025-04-30 10:42:52,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:52,023 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:42:52,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:52,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:42:52,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:42:52,023 INFO L87 Difference]: Start difference. First operand 186 states and 198 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:52,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:52,095 INFO L93 Difference]: Finished difference Result 195 states and 208 transitions. [2025-04-30 10:42:52,096 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:42:52,096 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-04-30 10:42:52,096 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:52,096 INFO L225 Difference]: With dead ends: 195 [2025-04-30 10:42:52,096 INFO L226 Difference]: Without dead ends: 195 [2025-04-30 10:42:52,097 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-04-30 10:42:52,097 INFO L437 NwaCegarLoop]: 186 mSDtfsCounter, 18 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 714 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-04-30 10:42:52,097 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 714 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:42:52,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-04-30 10:42:52,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 187. [2025-04-30 10:42:52,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 102 states have (on average 1.911764705882353) internal successors, (195), 183 states have internal predecessors, (195), 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-04-30 10:42:52,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2025-04-30 10:42:52,106 INFO L79 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 10 [2025-04-30 10:42:52,106 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:52,106 INFO L485 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2025-04-30 10:42:52,106 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:42:52,106 INFO L278 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2025-04-30 10:42:52,106 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-30 10:42:52,106 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:52,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:52,106 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:42:52,106 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:42:52,110 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:52,110 INFO L85 PathProgramCache]: Analyzing trace with hash -2141638496, now seen corresponding path program 1 times [2025-04-30 10:42:52,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:52,110 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87708348] [2025-04-30 10:42:52,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:52,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:52,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:42:52,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:42:52,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:52,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:52,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:52,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:52,154 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87708348] [2025-04-30 10:42:52,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87708348] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:52,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:52,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:42:52,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503596232] [2025-04-30 10:42:52,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:52,155 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:42:52,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:52,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:42:52,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:42:52,155 INFO L87 Difference]: Start difference. First operand 187 states and 199 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-04-30 10:42:52,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:52,179 INFO L93 Difference]: Finished difference Result 266 states and 282 transitions. [2025-04-30 10:42:52,180 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:42:52,181 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2025-04-30 10:42:52,181 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:52,182 INFO L225 Difference]: With dead ends: 266 [2025-04-30 10:42:52,182 INFO L226 Difference]: Without dead ends: 266 [2025-04-30 10:42:52,182 INFO L436 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-04-30 10:42:52,183 INFO L437 NwaCegarLoop]: 189 mSDtfsCounter, 83 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 563 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-04-30 10:42:52,183 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 563 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:42:52,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-04-30 10:42:52,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 230. [2025-04-30 10:42:52,193 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-04-30 10:42:52,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 282 transitions. [2025-04-30 10:42:52,195 INFO L79 Accepts]: Start accepts. Automaton has 230 states and 282 transitions. Word has length 12 [2025-04-30 10:42:52,195 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:52,195 INFO L485 AbstractCegarLoop]: Abstraction has 230 states and 282 transitions. [2025-04-30 10:42:52,195 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-04-30 10:42:52,196 INFO L278 IsEmpty]: Start isEmpty. Operand 230 states and 282 transitions. [2025-04-30 10:42:52,196 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:42:52,196 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:52,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:52,196 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:42:52,196 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:42:52,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:52,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1966277747, now seen corresponding path program 1 times [2025-04-30 10:42:52,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:52,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41592182] [2025-04-30 10:42:52,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:52,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:52,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:42:52,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:42:52,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:52,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:52,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:52,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:52,240 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41592182] [2025-04-30 10:42:52,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41592182] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:52,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:52,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:42:52,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614090934] [2025-04-30 10:42:52,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:52,241 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:42:52,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:52,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:42:52,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:42:52,241 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-04-30 10:42:52,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:52,332 INFO L93 Difference]: Finished difference Result 215 states and 252 transitions. [2025-04-30 10:42:52,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:42:52,332 INFO L79 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-04-30 10:42:52,332 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:52,333 INFO L225 Difference]: With dead ends: 215 [2025-04-30 10:42:52,333 INFO L226 Difference]: Without dead ends: 215 [2025-04-30 10:42:52,333 INFO L436 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-04-30 10:42:52,334 INFO L437 NwaCegarLoop]: 140 mSDtfsCounter, 46 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:52,334 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 205 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:52,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-04-30 10:42:52,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-04-30 10:42:52,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 144 states have (on average 1.7222222222222223) internal successors, (248), 210 states have internal predecessors, (248), 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-04-30 10:42:52,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 252 transitions. [2025-04-30 10:42:52,338 INFO L79 Accepts]: Start accepts. Automaton has 215 states and 252 transitions. Word has length 13 [2025-04-30 10:42:52,338 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:52,339 INFO L485 AbstractCegarLoop]: Abstraction has 215 states and 252 transitions. [2025-04-30 10:42:52,339 INFO L486 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-04-30 10:42:52,339 INFO L278 IsEmpty]: Start isEmpty. Operand 215 states and 252 transitions. [2025-04-30 10:42:52,339 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:42:52,339 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:52,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:52,339 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:42:52,339 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:42:52,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:52,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1966277746, now seen corresponding path program 1 times [2025-04-30 10:42:52,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:52,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766986403] [2025-04-30 10:42:52,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:52,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:52,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:42:52,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:42:52,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:52,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:52,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-04-30 10:42:52,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:52,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766986403] [2025-04-30 10:42:52,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766986403] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:52,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:52,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:42:52,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435412871] [2025-04-30 10:42:52,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:52,438 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:42:52,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:52,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:42:52,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:42:52,439 INFO L87 Difference]: Start difference. First operand 215 states and 252 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-04-30 10:42:52,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:52,519 INFO L93 Difference]: Finished difference Result 200 states and 222 transitions. [2025-04-30 10:42:52,519 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:42:52,519 INFO L79 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-04-30 10:42:52,520 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:52,520 INFO L225 Difference]: With dead ends: 200 [2025-04-30 10:42:52,520 INFO L226 Difference]: Without dead ends: 200 [2025-04-30 10:42:52,520 INFO L436 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-04-30 10:42:52,521 INFO L437 NwaCegarLoop]: 140 mSDtfsCounter, 46 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:52,521 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 207 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:52,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-04-30 10:42:52,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-04-30 10:42:52,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 144 states have (on average 1.5138888888888888) internal successors, (218), 195 states have internal predecessors, (218), 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-04-30 10:42:52,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 222 transitions. [2025-04-30 10:42:52,528 INFO L79 Accepts]: Start accepts. Automaton has 200 states and 222 transitions. Word has length 13 [2025-04-30 10:42:52,528 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:52,528 INFO L485 AbstractCegarLoop]: Abstraction has 200 states and 222 transitions. [2025-04-30 10:42:52,528 INFO L486 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-04-30 10:42:52,528 INFO L278 IsEmpty]: Start isEmpty. Operand 200 states and 222 transitions. [2025-04-30 10:42:52,528 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:42:52,528 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:52,528 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:52,528 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:42:52,528 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:42:52,529 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:52,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1790927923, now seen corresponding path program 1 times [2025-04-30 10:42:52,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:52,529 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095617090] [2025-04-30 10:42:52,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:52,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:52,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:42:52,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:42:52,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:52,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:52,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:52,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:52,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095617090] [2025-04-30 10:42:52,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095617090] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:52,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:52,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:42:52,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197133557] [2025-04-30 10:42:52,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:52,618 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:42:52,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:52,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:42:52,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:42:52,619 INFO L87 Difference]: Start difference. First operand 200 states and 222 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-04-30 10:42:52,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:52,762 INFO L93 Difference]: Finished difference Result 253 states and 288 transitions. [2025-04-30 10:42:52,762 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:42:52,762 INFO L79 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-04-30 10:42:52,762 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:52,763 INFO L225 Difference]: With dead ends: 253 [2025-04-30 10:42:52,763 INFO L226 Difference]: Without dead ends: 253 [2025-04-30 10:42:52,763 INFO L436 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-04-30 10:42:52,764 INFO L437 NwaCegarLoop]: 148 mSDtfsCounter, 24 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:52,764 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 413 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:52,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-04-30 10:42:52,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 208. [2025-04-30 10:42:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 152 states have (on average 1.513157894736842) internal successors, (230), 203 states have internal predecessors, (230), 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-04-30 10:42:52,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 234 transitions. [2025-04-30 10:42:52,768 INFO L79 Accepts]: Start accepts. Automaton has 208 states and 234 transitions. Word has length 18 [2025-04-30 10:42:52,768 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:52,768 INFO L485 AbstractCegarLoop]: Abstraction has 208 states and 234 transitions. [2025-04-30 10:42:52,768 INFO L486 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-04-30 10:42:52,768 INFO L278 IsEmpty]: Start isEmpty. Operand 208 states and 234 transitions. [2025-04-30 10:42:52,769 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:42:52,769 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:52,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:52,769 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:42:52,769 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:42:52,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:52,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1790927922, now seen corresponding path program 1 times [2025-04-30 10:42:52,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:52,769 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174004010] [2025-04-30 10:42:52,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:52,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:52,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:42:52,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:42:52,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:52,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:52,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:52,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:52,938 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174004010] [2025-04-30 10:42:52,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174004010] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:52,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:52,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:42:52,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157718428] [2025-04-30 10:42:52,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:52,938 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:42:52,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:52,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:42:52,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:42:52,939 INFO L87 Difference]: Start difference. First operand 208 states and 234 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-04-30 10:42:53,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:53,088 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2025-04-30 10:42:53,088 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:42:53,088 INFO L79 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-04-30 10:42:53,089 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:53,089 INFO L225 Difference]: With dead ends: 208 [2025-04-30 10:42:53,089 INFO L226 Difference]: Without dead ends: 208 [2025-04-30 10:42:53,089 INFO L436 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-04-30 10:42:53,090 INFO L437 NwaCegarLoop]: 159 mSDtfsCounter, 4 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:53,090 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 429 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:53,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-04-30 10:42:53,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2025-04-30 10:42:53,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 152 states have (on average 1.486842105263158) internal successors, (226), 203 states have internal predecessors, (226), 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-04-30 10:42:53,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 230 transitions. [2025-04-30 10:42:53,094 INFO L79 Accepts]: Start accepts. Automaton has 208 states and 230 transitions. Word has length 18 [2025-04-30 10:42:53,094 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:53,094 INFO L485 AbstractCegarLoop]: Abstraction has 208 states and 230 transitions. [2025-04-30 10:42:53,094 INFO L486 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-04-30 10:42:53,094 INFO L278 IsEmpty]: Start isEmpty. Operand 208 states and 230 transitions. [2025-04-30 10:42:53,095 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:42:53,095 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:53,095 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-04-30 10:42:53,095 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:42:53,096 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:42:53,097 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:53,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1880080999, now seen corresponding path program 1 times [2025-04-30 10:42:53,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:53,097 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681021497] [2025-04-30 10:42:53,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:53,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:53,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:42:53,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:42:53,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:53,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:53,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:53,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681021497] [2025-04-30 10:42:53,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681021497] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:53,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519207450] [2025-04-30 10:42:53,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:53,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:53,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:53,288 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-04-30 10:42:53,289 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-04-30 10:42:53,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:42:53,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:42:53,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:53,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:53,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-30 10:42:53,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:53,423 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:42:53,423 INFO L354 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-04-30 10:42:53,454 INFO L354 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-04-30 10:42:53,519 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-30 10:42:53,520 INFO L354 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-04-30 10:42:53,541 INFO L354 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-04-30 10:42:53,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:42:53,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:53,602 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_160 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ c_create_data_~data~0.offset 4))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse0) v_ArrVal_160) c_create_data_~data~0.base) .cse0))) 1)) is different from false [2025-04-30 10:42:53,614 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:53,615 INFO L354 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-04-30 10:42:53,617 INFO L354 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-04-30 10:42:53,624 INFO L354 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-04-30 10:42:53,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-04-30 10:42:53,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519207450] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:53,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:42:53,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2025-04-30 10:42:53,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90210076] [2025-04-30 10:42:53,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:53,643 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:42:53,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:53,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:42:53,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=109, Unknown=10, NotChecked=22, Total=182 [2025-04-30 10:42:53,643 INFO L87 Difference]: Start difference. First operand 208 states and 230 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-04-30 10:42:53,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:53,898 INFO L93 Difference]: Finished difference Result 209 states and 230 transitions. [2025-04-30 10:42:53,899 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:42:53,899 INFO L79 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-04-30 10:42:53,899 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:53,900 INFO L225 Difference]: With dead ends: 209 [2025-04-30 10:42:53,900 INFO L226 Difference]: Without dead ends: 209 [2025-04-30 10:42:53,900 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=109, Unknown=10, NotChecked=22, Total=182 [2025-04-30 10:42:53,900 INFO L437 NwaCegarLoop]: 147 mSDtfsCounter, 66 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:53,901 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 740 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 453 Invalid, 0 Unknown, 92 Unchecked, 0.2s Time] [2025-04-30 10:42:53,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-04-30 10:42:53,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2025-04-30 10:42:53,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 152 states have (on average 1.4736842105263157) internal successors, (224), 202 states have internal predecessors, (224), 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-04-30 10:42:53,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 228 transitions. [2025-04-30 10:42:53,905 INFO L79 Accepts]: Start accepts. Automaton has 207 states and 228 transitions. Word has length 23 [2025-04-30 10:42:53,905 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:53,905 INFO L485 AbstractCegarLoop]: Abstraction has 207 states and 228 transitions. [2025-04-30 10:42:53,905 INFO L486 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-04-30 10:42:53,905 INFO L278 IsEmpty]: Start isEmpty. Operand 207 states and 228 transitions. [2025-04-30 10:42:53,905 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:42:53,905 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:53,905 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-04-30 10:42:53,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:42:54,106 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-30 10:42:54,106 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:42:54,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:54,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1880080998, now seen corresponding path program 1 times [2025-04-30 10:42:54,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:54,107 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806172678] [2025-04-30 10:42:54,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:54,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:54,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:42:54,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:42:54,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:54,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:54,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:54,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:54,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806172678] [2025-04-30 10:42:54,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806172678] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:54,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942345879] [2025-04-30 10:42:54,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:54,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:54,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:54,406 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-04-30 10:42:54,408 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-04-30 10:42:54,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:42:54,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:42:54,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:54,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:54,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-30 10:42:54,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:54,496 INFO L354 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-04-30 10:42:54,505 INFO L354 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-04-30 10:42:54,525 INFO L354 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-04-30 10:42:54,531 INFO L354 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-04-30 10:42:54,634 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-30 10:42:54,634 INFO L354 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-04-30 10:42:54,640 INFO L354 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-04-30 10:42:54,684 INFO L354 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-04-30 10:42:54,689 INFO L354 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-04-30 10:42:54,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:54,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:54,794 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_create_data_~counter~0 4)) (.cse0 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_218 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_218) c_create_data_~data~0.base) .cse0) .cse1 4))) (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_219 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_218) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_219) c_create_data_~data~0.base) .cse0)))))) is different from false [2025-04-30 10:42:54,853 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_219 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_218) c_create_data_~data~0.base) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_219) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_218 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_218) c_create_data_~data~0.base) .cse1) 4)))))) is different from false [2025-04-30 10:42:54,860 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:54,861 INFO L354 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-04-30 10:42:54,864 INFO L354 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-04-30 10:42:54,875 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:54,875 INFO L354 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-04-30 10:42:54,880 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:54,880 INFO L354 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-04-30 10:42:54,883 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:42:54,885 INFO L354 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-04-30 10:42:54,887 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:42:54,888 INFO L354 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-04-30 10:42:54,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-04-30 10:42:54,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942345879] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:54,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:42:54,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 21 [2025-04-30 10:42:54,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013390337] [2025-04-30 10:42:54,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:54,913 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-30 10:42:54,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:54,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-30 10:42:54,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=301, Unknown=12, NotChecked=74, Total=462 [2025-04-30 10:42:54,913 INFO L87 Difference]: Start difference. First operand 207 states and 228 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-04-30 10:42:55,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:55,413 INFO L93 Difference]: Finished difference Result 227 states and 250 transitions. [2025-04-30 10:42:55,414 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:42:55,414 INFO L79 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-04-30 10:42:55,414 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:55,415 INFO L225 Difference]: With dead ends: 227 [2025-04-30 10:42:55,415 INFO L226 Difference]: Without dead ends: 227 [2025-04-30 10:42:55,415 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=431, Unknown=13, NotChecked=90, Total=650 [2025-04-30 10:42:55,416 INFO L437 NwaCegarLoop]: 157 mSDtfsCounter, 18 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 3 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:55,416 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1039 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 626 Invalid, 18 Unknown, 172 Unchecked, 0.4s Time] [2025-04-30 10:42:55,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-04-30 10:42:55,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2025-04-30 10:42:55,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 172 states have (on average 1.430232558139535) internal successors, (246), 222 states have internal predecessors, (246), 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-04-30 10:42:55,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 250 transitions. [2025-04-30 10:42:55,433 INFO L79 Accepts]: Start accepts. Automaton has 227 states and 250 transitions. Word has length 23 [2025-04-30 10:42:55,433 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:55,433 INFO L485 AbstractCegarLoop]: Abstraction has 227 states and 250 transitions. [2025-04-30 10:42:55,433 INFO L486 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-04-30 10:42:55,434 INFO L278 IsEmpty]: Start isEmpty. Operand 227 states and 250 transitions. [2025-04-30 10:42:55,434 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-30 10:42:55,434 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:55,434 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:55,448 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-04-30 10:42:55,634 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-30 10:42:55,634 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:42:55,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:55,635 INFO L85 PathProgramCache]: Analyzing trace with hash 697478682, now seen corresponding path program 2 times [2025-04-30 10:42:55,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:55,635 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538788671] [2025-04-30 10:42:55,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:42:55,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:55,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-30 10:42:55,665 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:42:55,665 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:42:55,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:56,159 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:56,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:56,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538788671] [2025-04-30 10:42:56,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538788671] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:56,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777733762] [2025-04-30 10:42:56,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:42:56,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:56,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:56,162 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-04-30 10:42:56,164 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-04-30 10:42:56,226 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-30 10:42:56,254 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:42:56,254 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:42:56,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:56,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-30 10:42:56,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:56,265 INFO L354 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-04-30 10:42:56,273 INFO L354 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-04-30 10:42:56,281 INFO L354 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-04-30 10:42:56,290 INFO L354 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-04-30 10:42:56,342 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-30 10:42:56,342 INFO L354 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-04-30 10:42:56,347 INFO L354 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-04-30 10:42:56,437 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-30 10:42:56,438 INFO L354 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-04-30 10:42:56,442 INFO L354 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-04-30 10:42:56,527 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-30 10:42:56,528 INFO L354 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-04-30 10:42:56,532 INFO L354 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-04-30 10:42:56,575 INFO L354 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-04-30 10:42:56,581 INFO L354 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-04-30 10:42:56,600 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:56,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:56,669 WARN L849 $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_305 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_305) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_305) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_306) c_create_data_~data~0.base) .cse1)))))) is different from false [2025-04-30 10:42:56,684 WARN L849 $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$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_305 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_305) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_305) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_306) c_create_data_~data~0.base) .cse2))))))) is different from false [2025-04-30 10:42:56,697 WARN L849 $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$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (<= (+ .cse0 12 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_305) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_306) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_305 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_305) c_create_data_~data~0.base) .cse2))))))) is different from false [2025-04-30 10:42:56,708 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_303))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_304) .cse0 v_ArrVal_305) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_306) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_304) (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_303) c_create_data_~data~0.base) .cse1) v_ArrVal_305) c_create_data_~data~0.base) .cse1) .cse2 8))))) is different from false [2025-04-30 10:42:56,779 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_303))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (<= (+ 16 .cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_304) .cse2 v_ArrVal_305) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_306) c_create_data_~data~0.base) .cse3)))))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (<= 0 (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_304) (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_303) c_create_data_~data~0.base) .cse3) v_ArrVal_305) c_create_data_~data~0.base) .cse3))))))) is different from false [2025-04-30 10:42:56,791 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse3 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= 0 (+ .cse0 12 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_302))) (let ((.cse1 (select (select .cse2 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_301) .cse1 v_ArrVal_304) (select (select (store .cse2 .cse1 v_ArrVal_303) c_create_data_~data~0.base) .cse3) v_ArrVal_305))) c_create_data_~data~0.base) .cse3)))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_302))) (let ((.cse4 (select (select .cse7 c_create_data_~data~0.base) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_303))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (<= (+ 16 .cse0 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_301) .cse4 v_ArrVal_304) .cse5 v_ArrVal_305) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_306) c_create_data_~data~0.base) .cse3)))))))))) is different from false [2025-04-30 10:42:56,813 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3)) (.cse4 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_302))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_303))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_301) .cse1 v_ArrVal_304) .cse2 v_ArrVal_305) c_create_data_~data~0.base) .cse3) 16 .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_306) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_302))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_301) .cse7 v_ArrVal_304) (select (select (store .cse8 .cse7 v_ArrVal_303) c_create_data_~data~0.base) .cse3) v_ArrVal_305))) c_create_data_~data~0.base) .cse3) .cse4 12)))))) is different from false [2025-04-30 10:42:56,834 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_302))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_303))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_301) .cse1 v_ArrVal_304) .cse2 v_ArrVal_305) c_create_data_~data~0.base) .cse3) 16) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_306) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_302))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_301) .cse6 v_ArrVal_304) (select (select (store .cse7 .cse6 v_ArrVal_303) c_create_data_~data~0.base) .cse3) v_ArrVal_305))) c_create_data_~data~0.base) .cse3) 12)))))) is different from false [2025-04-30 10:42:56,847 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:56,848 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 178 [2025-04-30 10:42:56,853 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:56,853 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 108 [2025-04-30 10:42:56,865 INFO L354 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 61134 treesize of output 52836 [2025-04-30 10:42:57,253 INFO L354 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 7258 treesize of output 7042 [2025-04-30 10:42:57,289 INFO L354 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 985 treesize of output 929 [2025-04-30 10:42:57,296 INFO L354 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 929 treesize of output 885 [2025-04-30 10:42:57,303 INFO L354 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 885 treesize of output 757 [2025-04-30 10:42:57,310 INFO L354 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 757 treesize of output 713 [2025-04-30 10:42:57,317 INFO L354 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 713 treesize of output 581 [2025-04-30 10:42:57,331 INFO L354 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 549 treesize of output 525 [2025-04-30 10:42:57,418 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:57,418 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 91 [2025-04-30 10:42:57,423 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:42:57,423 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 61 [2025-04-30 10:42:57,425 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:42:57,427 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 55 [2025-04-30 10:42:57,429 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:42:57,430 INFO L354 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-04-30 10:42:57,454 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2025-04-30 10:42:57,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777733762] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:57,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:42:57,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 31 [2025-04-30 10:42:57,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102251705] [2025-04-30 10:42:57,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:57,455 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-30 10:42:57,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:57,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-30 10:42:57,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=449, Unknown=9, NotChecked=408, Total=992 [2025-04-30 10:42:57,456 INFO L87 Difference]: Start difference. First operand 227 states and 250 transitions. Second operand has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 32 states have internal predecessors, (69), 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-04-30 10:42:57,859 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse2)) (.cse0 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (<= (+ .cse0 12 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_305) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_306) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_305 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_305) c_create_data_~data~0.base) .cse2)))) (<= (+ .cse3 .cse0 8) (select |c_#length| .cse1)) (<= 0 (+ .cse3 .cse0 4))))) is different from false [2025-04-30 10:42:57,924 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse1)) (.cse0 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_305 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_305) c_create_data_~data~0.base) .cse1)))) (<= 0 (+ .cse2 .cse0)) (<= (+ .cse2 .cse0 4) (select |c_#length| (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (<= 0 (+ |c_create_data_#t~mem8.offset| .cse0)) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_305) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_306) c_create_data_~data~0.base) .cse1)))) (<= (+ |c_create_data_#t~mem8.offset| .cse0 4) (select |c_#length| |c_create_data_#t~mem8.base|))))) is different from false [2025-04-30 10:42:58,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:58,385 INFO L93 Difference]: Finished difference Result 257 states and 282 transitions. [2025-04-30 10:42:58,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-30 10:42:58,386 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 32 states have internal predecessors, (69), 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 33 [2025-04-30 10:42:58,386 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:58,387 INFO L225 Difference]: With dead ends: 257 [2025-04-30 10:42:58,387 INFO L226 Difference]: Without dead ends: 257 [2025-04-30 10:42:58,387 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 47 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=738, Unknown=27, NotChecked=670, Total=1640 [2025-04-30 10:42:58,388 INFO L437 NwaCegarLoop]: 159 mSDtfsCounter, 9 mSDsluCounter, 1588 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 2 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1747 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 855 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:58,388 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1747 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 841 Invalid, 30 Unknown, 855 Unchecked, 0.6s Time] [2025-04-30 10:42:58,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-04-30 10:42:58,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2025-04-30 10:42:58,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 202 states have (on average 1.3762376237623761) internal successors, (278), 252 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-04-30 10:42:58,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 282 transitions. [2025-04-30 10:42:58,399 INFO L79 Accepts]: Start accepts. Automaton has 257 states and 282 transitions. Word has length 33 [2025-04-30 10:42:58,399 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:58,399 INFO L485 AbstractCegarLoop]: Abstraction has 257 states and 282 transitions. [2025-04-30 10:42:58,399 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 32 states have internal predecessors, (69), 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-04-30 10:42:58,399 INFO L278 IsEmpty]: Start isEmpty. Operand 257 states and 282 transitions. [2025-04-30 10:42:58,400 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-30 10:42:58,400 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:58,400 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 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-04-30 10:42:58,407 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-04-30 10:42:58,604 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:58,604 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:42:58,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:58,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1748340478, now seen corresponding path program 1 times [2025-04-30 10:42:58,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:58,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705618899] [2025-04-30 10:42:58,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:58,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:58,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:42:58,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:42:58,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:58,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-04-30 10:42:58,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:58,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705618899] [2025-04-30 10:42:58,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705618899] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:42:58,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:42:58,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:42:58,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083294058] [2025-04-30 10:42:58,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:42:58,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:42:58,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:58,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:42:58,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:42:58,669 INFO L87 Difference]: Start difference. First operand 257 states and 282 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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-04-30 10:42:58,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:58,735 INFO L93 Difference]: Finished difference Result 255 states and 278 transitions. [2025-04-30 10:42:58,735 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:42:58,735 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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 45 [2025-04-30 10:42:58,736 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:58,736 INFO L225 Difference]: With dead ends: 255 [2025-04-30 10:42:58,736 INFO L226 Difference]: Without dead ends: 255 [2025-04-30 10:42:58,736 INFO L436 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-04-30 10:42:58,737 INFO L437 NwaCegarLoop]: 152 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:58,737 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 239 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:42:58,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-04-30 10:42:58,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2025-04-30 10:42:58,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 202 states have (on average 1.3564356435643565) internal successors, (274), 250 states have internal predecessors, (274), 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-04-30 10:42:58,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 278 transitions. [2025-04-30 10:42:58,744 INFO L79 Accepts]: Start accepts. Automaton has 255 states and 278 transitions. Word has length 45 [2025-04-30 10:42:58,744 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:58,744 INFO L485 AbstractCegarLoop]: Abstraction has 255 states and 278 transitions. [2025-04-30 10:42:58,744 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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-04-30 10:42:58,744 INFO L278 IsEmpty]: Start isEmpty. Operand 255 states and 278 transitions. [2025-04-30 10:42:58,746 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-30 10:42:58,746 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:58,746 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 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-04-30 10:42:58,746 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:42:58,746 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:42:58,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:58,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1748340479, now seen corresponding path program 1 times [2025-04-30 10:42:58,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:58,747 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742792390] [2025-04-30 10:42:58,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:58,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:58,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:42:58,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:42:58,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:58,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:58,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:42:58,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742792390] [2025-04-30 10:42:58,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742792390] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:42:58,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521426967] [2025-04-30 10:42:58,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:42:58,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:42:58,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:42:58,832 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-04-30 10:42:58,833 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-04-30 10:42:58,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:42:58,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:42:58,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:42:58,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:42:58,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:42:58,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:42:58,951 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:58,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:42:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:42:59,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521426967] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:42:59,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:42:59,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-30 10:42:59,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397358148] [2025-04-30 10:42:59,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:42:59,003 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:42:59,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:42:59,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:42:59,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:42:59,004 INFO L87 Difference]: Start difference. First operand 255 states and 278 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 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-04-30 10:42:59,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:42:59,040 INFO L93 Difference]: Finished difference Result 289 states and 314 transitions. [2025-04-30 10:42:59,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:42:59,040 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 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 45 [2025-04-30 10:42:59,040 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:42:59,042 INFO L225 Difference]: With dead ends: 289 [2025-04-30 10:42:59,042 INFO L226 Difference]: Without dead ends: 289 [2025-04-30 10:42:59,042 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:42:59,042 INFO L437 NwaCegarLoop]: 156 mSDtfsCounter, 8 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:42:59,043 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 782 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:42:59,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-04-30 10:42:59,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2025-04-30 10:42:59,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 236 states have (on average 1.3135593220338984) internal successors, (310), 284 states have internal predecessors, (310), 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-04-30 10:42:59,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 314 transitions. [2025-04-30 10:42:59,047 INFO L79 Accepts]: Start accepts. Automaton has 289 states and 314 transitions. Word has length 45 [2025-04-30 10:42:59,048 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:42:59,048 INFO L485 AbstractCegarLoop]: Abstraction has 289 states and 314 transitions. [2025-04-30 10:42:59,048 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 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-04-30 10:42:59,048 INFO L278 IsEmpty]: Start isEmpty. Operand 289 states and 314 transitions. [2025-04-30 10:42:59,048 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-30 10:42:59,048 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:42:59,048 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:42:59,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:42:59,248 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-30 10:42:59,249 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:42:59,249 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:42:59,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1609054798, now seen corresponding path program 3 times [2025-04-30 10:42:59,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:42:59,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67239214] [2025-04-30 10:42:59,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:42:59,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:42:59,262 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 7 equivalence classes. [2025-04-30 10:42:59,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 48 of 48 statements. [2025-04-30 10:42:59,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-04-30 10:42:59,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:00,157 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:00,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:00,157 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67239214] [2025-04-30 10:43:00,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67239214] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:00,157 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106009232] [2025-04-30 10:43:00,157 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:43:00,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:00,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:00,159 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-04-30 10:43:00,160 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-04-30 10:43:00,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 7 equivalence classes. [2025-04-30 10:43:00,520 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 48 of 48 statements. [2025-04-30 10:43:00,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-04-30 10:43:00,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:00,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-04-30 10:43:00,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:43:00,544 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-30 10:43:00,556 INFO L354 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-04-30 10:43:00,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:43:00,564 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-04-30 10:43:00,597 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:43:00,600 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:43:00,704 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-30 10:43:00,704 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2025-04-30 10:43:00,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:43:00,709 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-04-30 10:43:00,798 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-30 10:43:00,799 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2025-04-30 10:43:00,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:43:00,803 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-04-30 10:43:00,897 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-30 10:43:00,897 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2025-04-30 10:43:00,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:43:00,901 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-04-30 10:43:01,014 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-30 10:43:01,015 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2025-04-30 10:43:01,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:43:01,020 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-04-30 10:43:01,124 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-30 10:43:01,124 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2025-04-30 10:43:01,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:43:01,127 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-04-30 10:43:01,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:43:01,209 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:43:01,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:43:01,214 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:43:01,279 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-04-30 10:43:01,283 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-30 10:43:01,316 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:01,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:43:01,648 WARN L849 $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_590 (Array Int Int)) (v_subst_2 Int)) (let ((.cse1 (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_590))) (or (forall ((v_ArrVal_591 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store .cse1 v_subst_2 v_ArrVal_591) c_create_data_~data~0.base) .cse2) 8))) (< (select |c_#length| v_subst_2) (+ (select (select .cse1 c_create_data_~data~0.base) .cse2) .cse0 8))))) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_subst_1 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_590))) (or (< (select |c_#length| v_subst_1) (+ (select (select .cse3 c_create_data_~data~0.base) .cse2) .cse0 8)) (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (<= (+ .cse0 12 (select (select (store .cse3 v_subst_1 v_ArrVal_591) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_589) v_subst_1 v_ArrVal_592) c_create_data_~data~0.base) .cse2))))))))) is different from false [2025-04-30 10:43:01,676 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse2 (* c_create_data_~counter~0 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_590 (Array Int Int)) (v_subst_2 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| .cse3 v_ArrVal_590))) (or (forall ((v_ArrVal_591 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 v_subst_2 v_ArrVal_591) c_create_data_~data~0.base) .cse1) .cse2 8))) (< (select |c_#length| v_subst_2) (+ (select (select .cse0 c_create_data_~data~0.base) .cse1) .cse2 8))))) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_subst_1 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#2.offset| .cse3 v_ArrVal_590))) (or (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (<= (+ .cse2 12 (select (select (store .cse4 v_subst_1 v_ArrVal_591) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_589) v_subst_1 v_ArrVal_592) c_create_data_~data~0.base) .cse1)))) (< (select |c_#length| v_subst_1) (+ (select (select .cse4 c_create_data_~data~0.base) .cse1) .cse2 8)))))))) is different from false [2025-04-30 10:43:01,708 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse2 (* c_create_data_~counter~0 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_590 (Array Int Int)) (v_subst_2 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| .cse3 v_ArrVal_590))) (or (< (select |c_#length| v_subst_2) (+ (select (select .cse0 c_create_data_~data~0.base) .cse1) .cse2 12)) (forall ((v_ArrVal_591 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 v_subst_2 v_ArrVal_591) c_create_data_~data~0.base) .cse1) .cse2 12)))))) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_subst_1 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#2.offset| .cse3 v_ArrVal_590))) (or (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (<= (+ 16 .cse2 (select (select (store .cse4 v_subst_1 v_ArrVal_591) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_589) v_subst_1 v_ArrVal_592) c_create_data_~data~0.base) .cse1)))) (< (select |c_#length| v_subst_1) (+ (select (select .cse4 c_create_data_~data~0.base) .cse1) .cse2 12)))))))) is different from false [2025-04-30 10:43:01,728 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_create_data_~counter~0 4)) (.cse1 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_588))) (let ((.cse4 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_587) .cse4 v_ArrVal_590))) (or (< (select |c_#length| v_subst_1) (+ (select (select .cse0 c_create_data_~data~0.base) .cse1) .cse2 12)) (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (<= (+ (select (select (store .cse0 v_subst_1 v_ArrVal_591) c_create_data_~data~0.base) .cse1) 16 .cse2) (select |c_#length| (select (select (store (store .cse3 .cse4 v_ArrVal_589) v_subst_1 v_ArrVal_592) c_create_data_~data~0.base) .cse1))))))))) (forall ((v_ArrVal_590 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_587) (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_588) c_create_data_~data~0.base) .cse1) v_ArrVal_590))) (or (forall ((v_ArrVal_591 (Array Int Int))) (<= 0 (+ (select (select (store .cse5 v_subst_2 v_ArrVal_591) c_create_data_~data~0.base) .cse1) .cse2 12))) (< (select |c_#length| v_subst_2) (+ (select (select .cse5 c_create_data_~data~0.base) .cse1) .cse2 12))))))) is different from false [2025-04-30 10:43:01,768 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_590 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$#2.offset| .cse3 v_ArrVal_587) (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_588) c_create_data_~data~0.base) .cse2) v_ArrVal_590))) (or (< (select |c_#length| v_subst_2) (+ .cse0 12 (select (select .cse1 c_create_data_~data~0.base) .cse2))) (forall ((v_ArrVal_591 (Array Int Int))) (<= 0 (+ (select (select (store .cse1 v_subst_2 v_ArrVal_591) c_create_data_~data~0.base) .cse2) .cse0 12)))))) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_588))) (let ((.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (let ((.cse4 (store (store |c_#memory_$Pointer$#2.offset| .cse3 v_ArrVal_587) .cse6 v_ArrVal_590))) (or (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (<= (+ (select (select (store .cse4 v_subst_1 v_ArrVal_591) c_create_data_~data~0.base) .cse2) 16 .cse0) (select |c_#length| (select (select (store (store .cse5 .cse6 v_ArrVal_589) v_subst_1 v_ArrVal_592) c_create_data_~data~0.base) .cse2)))) (< (select |c_#length| v_subst_1) (+ .cse0 12 (select (select .cse4 c_create_data_~data~0.base) .cse2))))))))))) is different from false [2025-04-30 10:43:01,801 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse5 v_ArrVal_588))) (let ((.cse4 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (let ((.cse1 (store (store |c_#memory_$Pointer$#2.offset| .cse5 v_ArrVal_587) .cse4 v_ArrVal_590))) (or (< (select |c_#length| v_subst_1) (+ 16 .cse0 (select (select .cse1 c_create_data_~data~0.base) .cse2))) (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (<= (+ (select (select (store .cse1 v_subst_1 v_ArrVal_591) c_create_data_~data~0.base) .cse2) .cse0 20) (select |c_#length| (select (select (store (store .cse3 .cse4 v_ArrVal_589) v_subst_1 v_ArrVal_592) c_create_data_~data~0.base) .cse2))))))))) (forall ((v_ArrVal_590 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_$Pointer$#2.offset| .cse5 v_ArrVal_587) (select (select (store |c_#memory_$Pointer$#2.base| .cse5 v_ArrVal_588) c_create_data_~data~0.base) .cse2) v_ArrVal_590))) (or (forall ((v_ArrVal_591 (Array Int Int))) (<= 0 (+ (select (select (store .cse6 v_subst_2 v_ArrVal_591) c_create_data_~data~0.base) .cse2) 16 .cse0))) (< (select |c_#length| v_subst_2) (+ 16 .cse0 (select (select .cse6 c_create_data_~data~0.base) .cse2))))))))) is different from false [2025-04-30 10:43:01,839 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_create_data_~counter~0 4)) (.cse1 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_586 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse0 (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_586))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse1))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_585) .cse3 v_ArrVal_587) (select (select (store .cse4 .cse3 v_ArrVal_588) c_create_data_~data~0.base) .cse1) v_ArrVal_590))))) (or (forall ((v_ArrVal_591 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 v_subst_2 v_ArrVal_591) c_create_data_~data~0.base) .cse1) 16 .cse2))) (< (select |c_#length| v_subst_2) (+ 16 .cse2 (select (select .cse0 c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_586))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse1))) (let ((.cse6 (store .cse9 .cse8 v_ArrVal_588))) (let ((.cse7 (select (select .cse6 c_create_data_~data~0.base) .cse1))) (let ((.cse5 (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_585) .cse8 v_ArrVal_587) .cse7 v_ArrVal_590))) (or (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (<= (+ (select (select (store .cse5 v_subst_1 v_ArrVal_591) c_create_data_~data~0.base) .cse1) .cse2 20) (select |c_#length| (select (select (store (store .cse6 .cse7 v_ArrVal_589) v_subst_1 v_ArrVal_592) c_create_data_~data~0.base) .cse1)))) (< (select |c_#length| v_subst_1) (+ 16 .cse2 (select (select .cse5 c_create_data_~data~0.base) .cse1)))))))))))) is different from false [2025-04-30 10:43:06,461 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_create_data_~counter~0 4)) (.cse1 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_586 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse0 (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_583))) (let ((.cse3 (select (select .cse6 c_create_data_~data~0.base) .cse1))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_586))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse1))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_584) .cse3 v_ArrVal_585) .cse4 v_ArrVal_587) (select (select (store .cse5 .cse4 v_ArrVal_588) c_create_data_~data~0.base) .cse1) v_ArrVal_590))))))) (or (< (select |c_#length| v_subst_2) (+ (select (select .cse0 c_create_data_~data~0.base) .cse1) .cse2 20)) (forall ((v_ArrVal_591 (Array Int Int))) (<= 0 (+ .cse2 20 (select (select (store .cse0 v_subst_2 v_ArrVal_591) c_create_data_~data~0.base) .cse1))))))) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_583))) (let ((.cse10 (select (select .cse13 c_create_data_~data~0.base) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_586))) (let ((.cse11 (select (select .cse12 c_create_data_~data~0.base) .cse1))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_588))) (let ((.cse9 (select (select .cse8 c_create_data_~data~0.base) .cse1))) (let ((.cse7 (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_584) .cse10 v_ArrVal_585) .cse11 v_ArrVal_587) .cse9 v_ArrVal_590))) (or (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (<= (+ .cse2 (select (select (store .cse7 v_subst_1 v_ArrVal_591) c_create_data_~data~0.base) .cse1) 24) (select |c_#length| (select (select (store (store .cse8 .cse9 v_ArrVal_589) v_subst_1 v_ArrVal_592) c_create_data_~data~0.base) .cse1)))) (< (select |c_#length| v_subst_1) (+ (select (select .cse7 c_create_data_~data~0.base) .cse1) .cse2 20))))))))))))) is different from false [2025-04-30 10:43:06,536 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse2 (* c_create_data_~counter~0 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_586 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse0 (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_583))) (let ((.cse4 (select (select .cse7 c_create_data_~data~0.base) .cse1))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_586))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse1))) (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse3 v_ArrVal_584) .cse4 v_ArrVal_585) .cse5 v_ArrVal_587) (select (select (store .cse6 .cse5 v_ArrVal_588) c_create_data_~data~0.base) .cse1) v_ArrVal_590))))))) (or (forall ((v_ArrVal_591 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 v_subst_2 v_ArrVal_591) c_create_data_~data~0.base) .cse1) .cse2 20))) (< (select |c_#length| v_subst_2) (+ .cse2 (select (select .cse0 c_create_data_~data~0.base) .cse1) 20))))) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_583))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_586))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse1))) (let ((.cse9 (store .cse13 .cse12 v_ArrVal_588))) (let ((.cse10 (select (select .cse9 c_create_data_~data~0.base) .cse1))) (let ((.cse8 (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse3 v_ArrVal_584) .cse11 v_ArrVal_585) .cse12 v_ArrVal_587) .cse10 v_ArrVal_590))) (or (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (<= (+ (select (select (store .cse8 v_subst_1 v_ArrVal_591) c_create_data_~data~0.base) .cse1) .cse2 24) (select |c_#length| (select (select (store (store .cse9 .cse10 v_ArrVal_589) v_subst_1 v_ArrVal_592) c_create_data_~data~0.base) .cse1)))) (< (select |c_#length| v_subst_1) (+ .cse2 (select (select .cse8 c_create_data_~data~0.base) .cse1) 20)))))))))))))) is different from false [2025-04-30 10:43:06,584 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| .cse5 v_ArrVal_583))) (let ((.cse6 (select (select .cse9 c_create_data_~data~0.base) .cse2))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_586))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store .cse8 .cse7 v_ArrVal_588))) (let ((.cse4 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (let ((.cse1 (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse5 v_ArrVal_584) .cse6 v_ArrVal_585) .cse7 v_ArrVal_587) .cse4 v_ArrVal_590))) (or (< (select |c_#length| v_subst_1) (+ .cse0 (select (select .cse1 c_create_data_~data~0.base) .cse2) 24)) (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (<= (+ (select (select (store .cse1 v_subst_1 v_ArrVal_591) c_create_data_~data~0.base) .cse2) .cse0 28) (select |c_#length| (select (select (store (store .cse3 .cse4 v_ArrVal_589) v_subst_1 v_ArrVal_592) c_create_data_~data~0.base) .cse2))))))))))))) (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_586 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse10 (let ((.cse14 (store |c_#memory_$Pointer$#2.base| .cse5 v_ArrVal_583))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse2))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_586))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse2))) (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse5 v_ArrVal_584) .cse11 v_ArrVal_585) .cse12 v_ArrVal_587) (select (select (store .cse13 .cse12 v_ArrVal_588) c_create_data_~data~0.base) .cse2) v_ArrVal_590))))))) (or (forall ((v_ArrVal_591 (Array Int Int))) (<= 0 (+ (select (select (store .cse10 v_subst_2 v_ArrVal_591) c_create_data_~data~0.base) .cse2) .cse0 24))) (< (select |c_#length| v_subst_2) (+ .cse0 (select (select .cse10 c_create_data_~data~0.base) .cse2) 24)))))))) is different from false [2025-04-30 10:43:06,663 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_create_data_~counter~0 4)) (.cse1 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_582))) (let ((.cse5 (select (select .cse10 c_create_data_~data~0.base) .cse1))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_583))) (let ((.cse6 (select (select .cse9 c_create_data_~data~0.base) .cse1))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_586))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse1))) (let ((.cse3 (store .cse8 .cse7 v_ArrVal_588))) (let ((.cse4 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (let ((.cse0 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_581) .cse5 v_ArrVal_584) .cse6 v_ArrVal_585) .cse7 v_ArrVal_587) .cse4 v_ArrVal_590))) (or (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (<= (+ (select (select (store .cse0 v_subst_1 v_ArrVal_591) c_create_data_~data~0.base) .cse1) .cse2 28) (select |c_#length| (select (select (store (store .cse3 .cse4 v_ArrVal_589) v_subst_1 v_ArrVal_592) c_create_data_~data~0.base) .cse1)))) (< (select |c_#length| v_subst_1) (+ .cse2 (select (select .cse0 c_create_data_~data~0.base) .cse1) 24))))))))))))) (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_586 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse11 (let ((.cse17 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_582))) (let ((.cse12 (select (select .cse17 c_create_data_~data~0.base) .cse1))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_583))) (let ((.cse13 (select (select .cse16 c_create_data_~data~0.base) .cse1))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_586))) (let ((.cse14 (select (select .cse15 c_create_data_~data~0.base) .cse1))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_581) .cse12 v_ArrVal_584) .cse13 v_ArrVal_585) .cse14 v_ArrVal_587) (select (select (store .cse15 .cse14 v_ArrVal_588) c_create_data_~data~0.base) .cse1) v_ArrVal_590))))))))) (or (forall ((v_ArrVal_591 (Array Int Int))) (<= 0 (+ .cse2 (select (select (store .cse11 v_subst_2 v_ArrVal_591) c_create_data_~data~0.base) .cse1) 24))) (< (select |c_#length| v_subst_2) (+ .cse2 (select (select .cse11 c_create_data_~data~0.base) .cse1) 24))))))) is different from false [2025-04-30 10:43:06,721 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse5 v_ArrVal_582))) (let ((.cse6 (select (select .cse11 c_create_data_~data~0.base) .cse2))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_583))) (let ((.cse7 (select (select .cse10 c_create_data_~data~0.base) .cse2))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_586))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store .cse9 .cse8 v_ArrVal_588))) (let ((.cse4 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (let ((.cse1 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse5 v_ArrVal_581) .cse6 v_ArrVal_584) .cse7 v_ArrVal_585) .cse8 v_ArrVal_587) .cse4 v_ArrVal_590))) (or (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (<= (+ .cse0 (select (select (store .cse1 v_subst_1 v_ArrVal_591) c_create_data_~data~0.base) .cse2) 28) (select |c_#length| (select (select (store (store .cse3 .cse4 v_ArrVal_589) v_subst_1 v_ArrVal_592) c_create_data_~data~0.base) .cse2)))) (< (select |c_#length| v_subst_1) (+ .cse0 (select (select .cse1 c_create_data_~data~0.base) .cse2) 24))))))))))))) (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_586 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse12 (let ((.cse18 (store |c_#memory_$Pointer$#2.base| .cse5 v_ArrVal_582))) (let ((.cse13 (select (select .cse18 c_create_data_~data~0.base) .cse2))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_583))) (let ((.cse14 (select (select .cse17 c_create_data_~data~0.base) .cse2))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_586))) (let ((.cse15 (select (select .cse16 c_create_data_~data~0.base) .cse2))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse5 v_ArrVal_581) .cse13 v_ArrVal_584) .cse14 v_ArrVal_585) .cse15 v_ArrVal_587) (select (select (store .cse16 .cse15 v_ArrVal_588) c_create_data_~data~0.base) .cse2) v_ArrVal_590))))))))) (or (forall ((v_ArrVal_591 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store .cse12 v_subst_2 v_ArrVal_591) c_create_data_~data~0.base) .cse2) 24))) (< (select |c_#length| v_subst_2) (+ .cse0 (select (select .cse12 c_create_data_~data~0.base) .cse2) 24)))))))) is different from false [2025-04-30 10:43:06,843 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_590 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_586 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse0 (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse2 v_ArrVal_582))) (let ((.cse3 (select (select .cse8 c_create_data_~data~0.base) .cse1))) (let ((.cse7 (store .cse8 .cse3 v_ArrVal_583))) (let ((.cse4 (select (select .cse7 c_create_data_~data~0.base) .cse1))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_586))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse1))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_581) .cse3 v_ArrVal_584) .cse4 v_ArrVal_585) .cse5 v_ArrVal_587) (select (select (store .cse6 .cse5 v_ArrVal_588) c_create_data_~data~0.base) .cse1) v_ArrVal_590))))))))) (or (forall ((v_ArrVal_591 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 v_subst_2 v_ArrVal_591) c_create_data_~data~0.base) .cse1) 24))) (< (select |c_#length| v_subst_2) (+ (select (select .cse0 c_create_data_~data~0.base) .cse1) 24))))) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$#2.base| .cse2 v_ArrVal_582))) (let ((.cse12 (select (select .cse17 c_create_data_~data~0.base) .cse1))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_583))) (let ((.cse13 (select (select .cse16 c_create_data_~data~0.base) .cse1))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_586))) (let ((.cse14 (select (select .cse15 c_create_data_~data~0.base) .cse1))) (let ((.cse10 (store .cse15 .cse14 v_ArrVal_588))) (let ((.cse11 (select (select .cse10 c_create_data_~data~0.base) .cse1))) (let ((.cse9 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_581) .cse12 v_ArrVal_584) .cse13 v_ArrVal_585) .cse14 v_ArrVal_587) .cse11 v_ArrVal_590))) (or (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (<= (+ (select (select (store .cse9 v_subst_1 v_ArrVal_591) c_create_data_~data~0.base) .cse1) 28) (select |c_#length| (select (select (store (store .cse10 .cse11 v_ArrVal_589) v_subst_1 v_ArrVal_592) c_create_data_~data~0.base) .cse1)))) (< (select |c_#length| v_subst_1) (+ (select (select .cse9 c_create_data_~data~0.base) .cse1) 24)))))))))))))))) is different from false [2025-04-30 10:43:06,864 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:43:06,864 INFO L354 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 714 treesize of output 704 [2025-04-30 10:43:06,872 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:43:06,872 INFO L354 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 694 treesize of output 404 [2025-04-30 10:43:06,921 INFO L354 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 19814033 treesize of output 17120531 [2025-04-30 10:43:25,730 WARN L286 SmtUtils]: Spent 18.80s on a formula simplification. DAG size of input: 3185 DAG size of output: 780 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-30 10:43:26,044 INFO L354 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 10669725 treesize of output 10625859 [2025-04-30 10:43:26,826 INFO L354 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 9547 treesize of output 9459 [2025-04-30 10:43:26,879 INFO L354 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 9459 treesize of output 9355 [2025-04-30 10:43:26,932 INFO L354 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 9355 treesize of output 8475 [2025-04-30 10:43:26,995 INFO L354 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 8475 treesize of output 7867 [2025-04-30 10:43:27,048 INFO L354 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 7867 treesize of output 7347 [2025-04-30 10:43:27,105 INFO L354 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 4890 treesize of output 4402 [2025-04-30 10:43:27,160 INFO L354 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 6859 treesize of output 6379 [2025-04-30 10:43:27,214 INFO L354 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 6379 treesize of output 6315 [2025-04-30 10:43:27,266 INFO L354 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 6315 treesize of output 5891 [2025-04-30 10:43:27,330 INFO L354 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 5605 treesize of output 5541 [2025-04-30 10:43:38,472 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:43:38,473 INFO L354 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 1068 treesize of output 1058 [2025-04-30 10:43:38,478 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:43:38,478 INFO L354 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 1048 treesize of output 598 [2025-04-30 10:43:38,480 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:43:38,539 INFO L354 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 832843 treesize of output 740683 [2025-04-30 10:43:38,590 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:43:38,591 INFO L354 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 109 treesize of output 85 [2025-04-30 10:43:38,594 INFO L354 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-04-30 10:43:38,595 INFO L354 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 15 treesize of output 11 [2025-04-30 10:43:38,654 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 88 not checked. [2025-04-30 10:43:38,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106009232] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:43:38,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:43:38,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 23] total 57 [2025-04-30 10:43:38,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660128474] [2025-04-30 10:43:38,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:43:38,655 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-04-30 10:43:38,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:38,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-04-30 10:43:38,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=1666, Unknown=21, NotChecked=1274, Total=3306 [2025-04-30 10:43:38,657 INFO L87 Difference]: Start difference. First operand 289 states and 314 transitions. Second operand has 58 states, 57 states have (on average 2.1578947368421053) internal successors, (123), 58 states have internal predecessors, (123), 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-04-30 10:43:50,061 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-30 10:43:54,591 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15