./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-551b009-m [2025-01-09 22:22:06,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:22:06,547 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:22:06,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:22:06,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:22:06,580 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:22:06,580 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:22:06,580 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:22:06,581 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:22:06,581 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:22:06,582 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:22:06,582 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:22:06,582 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:22:06,582 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:22:06,582 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:22:06,583 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:22:06,583 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:22:06,583 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:22:06,583 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:22:06,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:22:06,583 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:22:06,583 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:22:06,583 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:22:06,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:22:06,584 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:22:06,584 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:22:06,584 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:22:06,584 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:22:06,584 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:22:06,584 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:22:06,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:22:06,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:22:06,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:22:06,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:22:06,585 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:22:06,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:22:06,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:22:06,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:22:06,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:22:06,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:22:06,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:22:06,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:22:06,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:22:06,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:22:06,585 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:22:06,585 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:22:06,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:22:06,585 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-jdk21/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-01-09 22:22:06,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:22:06,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:22:06,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:22:06,828 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:22:06,828 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:22:06,828 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2025-01-09 22:22:07,990 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/966bf374b/d3798042c6074e58abde5bd57d679222/FLAG7f36ace57 [2025-01-09 22:22:08,276 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:22:08,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2025-01-09 22:22:08,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/966bf374b/d3798042c6074e58abde5bd57d679222/FLAG7f36ace57 [2025-01-09 22:22:08,555 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/966bf374b/d3798042c6074e58abde5bd57d679222 [2025-01-09 22:22:08,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:22:08,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:22:08,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:22:08,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:22:08,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:22:08,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:22:08" (1/1) ... [2025-01-09 22:22:08,562 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca7ca20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:08, skipping insertion in model container [2025-01-09 22:22:08,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:22:08" (1/1) ... [2025-01-09 22:22:08,584 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:22:08,758 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:22:08,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:22:08,783 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:22:08,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:22:08,836 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:22:08,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:08 WrapperNode [2025-01-09 22:22:08,838 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:22:08,839 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:22:08,839 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:22:08,839 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:22:08,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:08" (1/1) ... [2025-01-09 22:22:08,858 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:08" (1/1) ... [2025-01-09 22:22:08,875 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102 [2025-01-09 22:22:08,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:22:08,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:22:08,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:22:08,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:22:08,883 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:08" (1/1) ... [2025-01-09 22:22:08,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:08" (1/1) ... [2025-01-09 22:22:08,886 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:08" (1/1) ... [2025-01-09 22:22:08,913 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-01-09 22:22:08,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:08" (1/1) ... [2025-01-09 22:22:08,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:08" (1/1) ... [2025-01-09 22:22:08,924 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:08" (1/1) ... [2025-01-09 22:22:08,928 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:08" (1/1) ... [2025-01-09 22:22:08,930 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:08" (1/1) ... [2025-01-09 22:22:08,931 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:08" (1/1) ... [2025-01-09 22:22:08,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:08" (1/1) ... [2025-01-09 22:22:08,937 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:22:08,937 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:22:08,937 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:22:08,937 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:22:08,938 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:08" (1/1) ... [2025-01-09 22:22:08,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:22:08,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:22:08,971 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:22:08,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:22:08,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:22:08,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:22:08,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 22:22:08,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:22:08,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:22:08,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 22:22:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:22:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2025-01-09 22:22:09,000 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2025-01-09 22:22:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:22:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:22:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:22:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:22:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 22:22:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:22:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:22:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 22:22:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:22:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 22:22:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 22:22:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 22:22:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:22:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:22:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:22:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:22:09,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:22:09,119 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:22:09,120 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:22:09,500 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2025-01-09 22:22:09,500 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:22:09,512 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:22:09,515 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 22:22:09,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:22:09 BoogieIcfgContainer [2025-01-09 22:22:09,516 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:22:09,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:22:09,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:22:09,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:22:09,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:22:08" (1/3) ... [2025-01-09 22:22:09,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5628fbf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:22:09, skipping insertion in model container [2025-01-09 22:22:09,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:08" (2/3) ... [2025-01-09 22:22:09,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5628fbf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:22:09, skipping insertion in model container [2025-01-09 22:22:09,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:22:09" (3/3) ... [2025-01-09 22:22:09,530 INFO L128 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2025-01-09 22:22:09,545 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:22:09,550 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG complex_data_creation_test01-1.i that has 2 procedures, 193 locations, 1 initial locations, 4 loop locations, and 92 error locations. [2025-01-09 22:22:09,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:22:09,615 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2c61ad85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:22:09,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2025-01-09 22:22:09,618 INFO L276 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-01-09 22:22:09,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:22:09,628 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:09,628 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:22:09,628 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:09,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:09,634 INFO L85 PathProgramCache]: Analyzing trace with hash 4742853, now seen corresponding path program 1 times [2025-01-09 22:22:09,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:09,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940108839] [2025-01-09 22:22:09,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:09,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:09,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:22:09,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:22:09,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:09,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:09,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:09,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:09,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940108839] [2025-01-09 22:22:09,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940108839] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:09,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:09,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:22:09,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519384112] [2025-01-09 22:22:09,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:09,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:22:09,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:09,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:22:09,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:22:09,916 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-01-09 22:22:10,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:10,137 INFO L93 Difference]: Finished difference Result 187 states and 199 transitions. [2025-01-09 22:22:10,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:22:10,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-09 22:22:10,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:10,143 INFO L225 Difference]: With dead ends: 187 [2025-01-09 22:22:10,145 INFO L226 Difference]: Without dead ends: 185 [2025-01-09 22:22:10,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:22:10,148 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 76 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-01-09 22:22:10,150 INFO L436 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-01-09 22:22:10,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-01-09 22:22:10,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-01-09 22:22:10,176 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-01-09 22:22:10,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2025-01-09 22:22:10,180 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 4 [2025-01-09 22:22:10,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:10,180 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2025-01-09 22:22:10,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:10,180 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2025-01-09 22:22:10,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:22:10,181 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:10,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:22:10,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:22:10,181 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:10,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:10,182 INFO L85 PathProgramCache]: Analyzing trace with hash 4742854, now seen corresponding path program 1 times [2025-01-09 22:22:10,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:10,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548416588] [2025-01-09 22:22:10,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:10,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:10,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:22:10,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:22:10,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:10,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:10,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:10,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:10,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548416588] [2025-01-09 22:22:10,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548416588] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:10,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:10,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:22:10,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259542189] [2025-01-09 22:22:10,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:10,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:22:10,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:10,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:22:10,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:22:10,301 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-01-09 22:22:10,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:10,497 INFO L93 Difference]: Finished difference Result 201 states and 216 transitions. [2025-01-09 22:22:10,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:22:10,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-09 22:22:10,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:10,499 INFO L225 Difference]: With dead ends: 201 [2025-01-09 22:22:10,499 INFO L226 Difference]: Without dead ends: 201 [2025-01-09 22:22:10,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:22:10,500 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 28 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-01-09 22:22:10,500 INFO L436 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-01-09 22:22:10,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-01-09 22:22:10,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 190. [2025-01-09 22:22:10,506 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-01-09 22:22:10,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 204 transitions. [2025-01-09 22:22:10,507 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 204 transitions. Word has length 4 [2025-01-09 22:22:10,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:10,507 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 204 transitions. [2025-01-09 22:22:10,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:10,507 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 204 transitions. [2025-01-09 22:22:10,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:22:10,508 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:10,508 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:22:10,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:22:10,508 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:10,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:10,508 INFO L85 PathProgramCache]: Analyzing trace with hash 147028547, now seen corresponding path program 1 times [2025-01-09 22:22:10,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:10,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671157685] [2025-01-09 22:22:10,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:10,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:10,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:22:10,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:22:10,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:10,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:10,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:10,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671157685] [2025-01-09 22:22:10,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671157685] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:10,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:10,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:22:10,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623848626] [2025-01-09 22:22:10,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:10,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:22:10,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:10,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:22:10,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:10,546 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-01-09 22:22:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:10,651 INFO L93 Difference]: Finished difference Result 188 states and 201 transitions. [2025-01-09 22:22:10,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:22:10,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-09 22:22:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:10,653 INFO L225 Difference]: With dead ends: 188 [2025-01-09 22:22:10,653 INFO L226 Difference]: Without dead ends: 188 [2025-01-09 22:22:10,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:10,653 INFO L435 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-01-09 22:22:10,654 INFO L436 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-01-09 22:22:10,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-01-09 22:22:10,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-01-09 22:22:10,658 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-01-09 22:22:10,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2025-01-09 22:22:10,659 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 5 [2025-01-09 22:22:10,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:10,659 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2025-01-09 22:22:10,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:10,660 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2025-01-09 22:22:10,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:22:10,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:10,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:22:10,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:22:10,660 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:10,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:10,660 INFO L85 PathProgramCache]: Analyzing trace with hash 147028548, now seen corresponding path program 1 times [2025-01-09 22:22:10,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:10,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897801202] [2025-01-09 22:22:10,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:10,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:10,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:22:10,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:22:10,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:10,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:10,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:10,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:10,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897801202] [2025-01-09 22:22:10,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897801202] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:10,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:10,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:22:10,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707750054] [2025-01-09 22:22:10,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:10,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:22:10,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:10,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:22:10,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:10,719 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-01-09 22:22:10,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:10,812 INFO L93 Difference]: Finished difference Result 186 states and 198 transitions. [2025-01-09 22:22:10,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:22:10,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-09 22:22:10,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:10,813 INFO L225 Difference]: With dead ends: 186 [2025-01-09 22:22:10,813 INFO L226 Difference]: Without dead ends: 186 [2025-01-09 22:22:10,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:10,814 INFO L435 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-01-09 22:22:10,815 INFO L436 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-01-09 22:22:10,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-01-09 22:22:10,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-01-09 22:22:10,824 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-01-09 22:22:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 198 transitions. [2025-01-09 22:22:10,825 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 198 transitions. Word has length 5 [2025-01-09 22:22:10,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:10,825 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 198 transitions. [2025-01-09 22:22:10,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:10,825 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 198 transitions. [2025-01-09 22:22:10,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 22:22:10,825 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:10,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:10,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:22:10,825 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:10,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:10,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1597754313, now seen corresponding path program 1 times [2025-01-09 22:22:10,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:10,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267133707] [2025-01-09 22:22:10,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:10,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:10,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 22:22:10,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 22:22:10,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:10,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:10,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:10,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:10,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267133707] [2025-01-09 22:22:10,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267133707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:10,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:10,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:22:10,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139966126] [2025-01-09 22:22:10,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:10,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:22:10,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:10,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:22:10,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:22:10,903 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-01-09 22:22:10,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:10,963 INFO L93 Difference]: Finished difference Result 195 states and 208 transitions. [2025-01-09 22:22:10,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:22:10,963 INFO L78 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-01-09 22:22:10,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:10,964 INFO L225 Difference]: With dead ends: 195 [2025-01-09 22:22:10,964 INFO L226 Difference]: Without dead ends: 195 [2025-01-09 22:22:10,964 INFO L434 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-01-09 22:22:10,965 INFO L435 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-01-09 22:22:10,965 INFO L436 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-01-09 22:22:10,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-01-09 22:22:10,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 187. [2025-01-09 22:22:10,973 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-01-09 22:22:10,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2025-01-09 22:22:10,975 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 10 [2025-01-09 22:22:10,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:10,975 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2025-01-09 22:22:10,975 INFO L472 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-01-09 22:22:10,975 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2025-01-09 22:22:10,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 22:22:10,977 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:10,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:10,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:22:10,977 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:10,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:10,978 INFO L85 PathProgramCache]: Analyzing trace with hash -2141638496, now seen corresponding path program 1 times [2025-01-09 22:22:10,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:10,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21596152] [2025-01-09 22:22:10,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:10,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:10,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 22:22:10,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 22:22:10,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:10,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:11,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:11,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:11,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21596152] [2025-01-09 22:22:11,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21596152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:11,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:11,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:22:11,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473762899] [2025-01-09 22:22:11,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:11,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:22:11,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:11,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:22:11,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:22:11,036 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-01-09 22:22:11,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:11,059 INFO L93 Difference]: Finished difference Result 266 states and 282 transitions. [2025-01-09 22:22:11,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:22:11,059 INFO L78 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-01-09 22:22:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:11,060 INFO L225 Difference]: With dead ends: 266 [2025-01-09 22:22:11,060 INFO L226 Difference]: Without dead ends: 266 [2025-01-09 22:22:11,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:22:11,061 INFO L435 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-01-09 22:22:11,061 INFO L436 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-01-09 22:22:11,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-01-09 22:22:11,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 230. [2025-01-09 22:22:11,070 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-01-09 22:22:11,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 282 transitions. [2025-01-09 22:22:11,071 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 282 transitions. Word has length 12 [2025-01-09 22:22:11,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:11,071 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 282 transitions. [2025-01-09 22:22:11,071 INFO L472 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-01-09 22:22:11,071 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 282 transitions. [2025-01-09 22:22:11,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 22:22:11,071 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:11,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:11,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:22:11,072 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:11,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:11,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1966277747, now seen corresponding path program 1 times [2025-01-09 22:22:11,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:11,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66459544] [2025-01-09 22:22:11,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:11,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:11,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:22:11,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:22:11,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:11,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:11,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-01-09 22:22:11,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:11,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66459544] [2025-01-09 22:22:11,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66459544] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:11,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:11,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:22:11,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503806999] [2025-01-09 22:22:11,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:11,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:22:11,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:11,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:22:11,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:11,155 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-01-09 22:22:11,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:11,246 INFO L93 Difference]: Finished difference Result 215 states and 252 transitions. [2025-01-09 22:22:11,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:22:11,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-09 22:22:11,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:11,248 INFO L225 Difference]: With dead ends: 215 [2025-01-09 22:22:11,248 INFO L226 Difference]: Without dead ends: 215 [2025-01-09 22:22:11,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:11,248 INFO L435 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-01-09 22:22:11,249 INFO L436 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-01-09 22:22:11,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-01-09 22:22:11,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-01-09 22:22:11,252 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-01-09 22:22:11,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 252 transitions. [2025-01-09 22:22:11,252 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 252 transitions. Word has length 13 [2025-01-09 22:22:11,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:11,253 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 252 transitions. [2025-01-09 22:22:11,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:11,253 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 252 transitions. [2025-01-09 22:22:11,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 22:22:11,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:11,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:11,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:22:11,253 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:11,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:11,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1966277746, now seen corresponding path program 1 times [2025-01-09 22:22:11,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:11,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616004756] [2025-01-09 22:22:11,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:11,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:11,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:22:11,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:22:11,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:11,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:11,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:11,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:11,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616004756] [2025-01-09 22:22:11,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616004756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:11,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:11,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:22:11,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475057299] [2025-01-09 22:22:11,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:11,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:22:11,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:11,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:22:11,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:11,370 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-01-09 22:22:11,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:11,490 INFO L93 Difference]: Finished difference Result 200 states and 222 transitions. [2025-01-09 22:22:11,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:22:11,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-09 22:22:11,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:11,491 INFO L225 Difference]: With dead ends: 200 [2025-01-09 22:22:11,494 INFO L226 Difference]: Without dead ends: 200 [2025-01-09 22:22:11,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:11,495 INFO L435 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-01-09 22:22:11,495 INFO L436 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-01-09 22:22:11,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-01-09 22:22:11,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-01-09 22:22:11,502 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-01-09 22:22:11,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 222 transitions. [2025-01-09 22:22:11,502 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 222 transitions. Word has length 13 [2025-01-09 22:22:11,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:11,502 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 222 transitions. [2025-01-09 22:22:11,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:11,502 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 222 transitions. [2025-01-09 22:22:11,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:22:11,503 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:11,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:11,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:22:11,503 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:11,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:11,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1790927923, now seen corresponding path program 1 times [2025-01-09 22:22:11,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:11,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242381188] [2025-01-09 22:22:11,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:11,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:11,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:22:11,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:22:11,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:11,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:11,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:11,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:11,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242381188] [2025-01-09 22:22:11,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242381188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:11,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:11,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:22:11,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304960093] [2025-01-09 22:22:11,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:11,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:22:11,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:11,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:22:11,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:22:11,634 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-01-09 22:22:11,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:11,870 INFO L93 Difference]: Finished difference Result 253 states and 288 transitions. [2025-01-09 22:22:11,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:22:11,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-09 22:22:11,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:11,871 INFO L225 Difference]: With dead ends: 253 [2025-01-09 22:22:11,875 INFO L226 Difference]: Without dead ends: 253 [2025-01-09 22:22:11,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:22:11,876 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 24 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:11,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 413 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:22:11,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-01-09 22:22:11,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 208. [2025-01-09 22:22:11,879 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-01-09 22:22:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 234 transitions. [2025-01-09 22:22:11,883 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 234 transitions. Word has length 18 [2025-01-09 22:22:11,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:11,883 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 234 transitions. [2025-01-09 22:22:11,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:11,883 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 234 transitions. [2025-01-09 22:22:11,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:22:11,883 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:11,884 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:11,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:22:11,884 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:11,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:11,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1790927922, now seen corresponding path program 1 times [2025-01-09 22:22:11,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:11,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661249939] [2025-01-09 22:22:11,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:11,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:11,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:22:11,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:22:11,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:11,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:12,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:12,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661249939] [2025-01-09 22:22:12,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661249939] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:12,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:12,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:22:12,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812987954] [2025-01-09 22:22:12,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:12,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:22:12,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:12,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:22:12,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:22:12,127 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-01-09 22:22:12,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:12,356 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2025-01-09 22:22:12,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:22:12,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-09 22:22:12,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:12,357 INFO L225 Difference]: With dead ends: 208 [2025-01-09 22:22:12,357 INFO L226 Difference]: Without dead ends: 208 [2025-01-09 22:22:12,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:22:12,358 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 4 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:12,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 429 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:22:12,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-01-09 22:22:12,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2025-01-09 22:22:12,365 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-01-09 22:22:12,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 230 transitions. [2025-01-09 22:22:12,365 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 230 transitions. Word has length 18 [2025-01-09 22:22:12,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:12,365 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 230 transitions. [2025-01-09 22:22:12,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:12,366 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 230 transitions. [2025-01-09 22:22:12,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:22:12,366 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:12,366 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-01-09 22:22:12,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:22:12,366 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:12,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:12,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1880080999, now seen corresponding path program 1 times [2025-01-09 22:22:12,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:12,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276390129] [2025-01-09 22:22:12,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:12,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:12,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:22:12,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:22:12,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:12,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:12,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:12,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276390129] [2025-01-09 22:22:12,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276390129] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:22:12,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566738567] [2025-01-09 22:22:12,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:12,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:12,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:22:12,605 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:22:12,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 22:22:12,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:22:12,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:22:12,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:12,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:12,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 22:22:12,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:22:12,749 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:22:12,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-01-09 22:22:12,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:22:12,880 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:22:12,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-09 22:22:12,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-09 22:22:12,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:22:12,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:22:13,018 WARN L851 $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-01-09 22:22:13,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:13,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-01-09 22:22:13,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-01-09 22:22:13,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2025-01-09 22:22:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-01-09 22:22:13,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566738567] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:22:13,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:22:13,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2025-01-09 22:22:13,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166257535] [2025-01-09 22:22:13,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:22:13,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 22:22:13,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:13,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 22:22:13,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=109, Unknown=10, NotChecked=22, Total=182 [2025-01-09 22:22:13,076 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-01-09 22:22:13,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:13,402 INFO L93 Difference]: Finished difference Result 209 states and 230 transitions. [2025-01-09 22:22:13,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:22:13,402 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-01-09 22:22:13,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:13,403 INFO L225 Difference]: With dead ends: 209 [2025-01-09 22:22:13,403 INFO L226 Difference]: Without dead ends: 209 [2025-01-09 22:22:13,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=109, Unknown=10, NotChecked=22, Total=182 [2025-01-09 22:22:13,404 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 66 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:13,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 740 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 453 Invalid, 0 Unknown, 92 Unchecked, 0.3s Time] [2025-01-09 22:22:13,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-01-09 22:22:13,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2025-01-09 22:22:13,407 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-01-09 22:22:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 228 transitions. [2025-01-09 22:22:13,408 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 228 transitions. Word has length 23 [2025-01-09 22:22:13,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:13,408 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 228 transitions. [2025-01-09 22:22:13,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:13,408 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 228 transitions. [2025-01-09 22:22:13,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:22:13,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:13,409 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-01-09 22:22:13,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 22:22:13,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 22:22:13,613 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:13,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:13,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1880080998, now seen corresponding path program 1 times [2025-01-09 22:22:13,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:13,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921304100] [2025-01-09 22:22:13,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:13,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:13,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:22:13,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:22:13,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:13,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:14,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:14,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:14,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921304100] [2025-01-09 22:22:14,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921304100] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:22:14,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677296765] [2025-01-09 22:22:14,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:14,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:14,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:22:14,101 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:22:14,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 22:22:14,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:22:14,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:22:14,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:14,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:14,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 22:22:14,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:22:14,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-01-09 22:22:14,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-01-09 22:22:14,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 22:22:14,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:22:14,376 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:22:14,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-09 22:22:14,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-09 22:22:14,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-09 22:22:14,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-09 22:22:14,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:14,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:22:14,533 WARN L851 $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-01-09 22:22:14,588 WARN L851 $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-01-09 22:22:14,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:14,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-01-09 22:22:14,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-01-09 22:22:14,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:14,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2025-01-09 22:22:14,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:14,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2025-01-09 22:22:14,616 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:14,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-01-09 22:22:14,620 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:14,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-01-09 22:22:14,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-01-09 22:22:14,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677296765] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:22:14,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:22:14,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 21 [2025-01-09 22:22:14,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801761658] [2025-01-09 22:22:14,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:22:14,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 22:22:14,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:14,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 22:22:14,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=301, Unknown=12, NotChecked=74, Total=462 [2025-01-09 22:22:14,644 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-01-09 22:22:15,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:15,172 INFO L93 Difference]: Finished difference Result 227 states and 250 transitions. [2025-01-09 22:22:15,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:22:15,173 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-01-09 22:22:15,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:15,174 INFO L225 Difference]: With dead ends: 227 [2025-01-09 22:22:15,174 INFO L226 Difference]: Without dead ends: 227 [2025-01-09 22:22:15,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=431, Unknown=13, NotChecked=90, Total=650 [2025-01-09 22:22:15,174 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 18 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 3 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-01-09 22:22:15,174 INFO L436 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-01-09 22:22:15,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-01-09 22:22:15,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2025-01-09 22:22:15,177 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-01-09 22:22:15,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 250 transitions. [2025-01-09 22:22:15,178 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 250 transitions. Word has length 23 [2025-01-09 22:22:15,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:15,178 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 250 transitions. [2025-01-09 22:22:15,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:15,179 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 250 transitions. [2025-01-09 22:22:15,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:22:15,179 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:15,179 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-01-09 22:22:15,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 22:22:15,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:15,384 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:15,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:15,385 INFO L85 PathProgramCache]: Analyzing trace with hash 697478682, now seen corresponding path program 2 times [2025-01-09 22:22:15,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:15,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682609409] [2025-01-09 22:22:15,385 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:22:15,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:15,394 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-09 22:22:15,407 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:22:15,407 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:22:15,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:15,991 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:15,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:15,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682609409] [2025-01-09 22:22:15,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682609409] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:22:15,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872568807] [2025-01-09 22:22:15,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:22:15,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:15,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:22:15,994 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:22:15,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 22:22:16,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-09 22:22:16,076 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:22:16,076 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:22:16,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:16,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 22:22:16,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:22:16,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-01-09 22:22:16,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-01-09 22:22:16,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 22:22:16,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:22:16,152 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:22:16,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-09 22:22:16,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-09 22:22:16,245 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:22:16,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-09 22:22:16,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-09 22:22:16,335 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:22:16,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-09 22:22:16,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-09 22:22:16,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-09 22:22:16,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-09 22:22:16,411 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:16,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:22:16,480 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_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-01-09 22:22:16,496 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#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-01-09 22:22:16,512 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#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-01-09 22:22:16,524 WARN L851 $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-01-09 22:22:16,606 WARN L851 $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-01-09 22:22:16,619 WARN L851 $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-01-09 22:22:16,637 WARN L851 $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-01-09 22:22:16,655 WARN L851 $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-01-09 22:22:16,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:16,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 178 [2025-01-09 22:22:16,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:16,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 108 [2025-01-09 22:22:16,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61134 treesize of output 52836 [2025-01-09 22:22:17,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7258 treesize of output 7042 [2025-01-09 22:22:17,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 985 treesize of output 929 [2025-01-09 22:22:17,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 929 treesize of output 885 [2025-01-09 22:22:17,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 885 treesize of output 757 [2025-01-09 22:22:17,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 757 treesize of output 713 [2025-01-09 22:22:17,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 713 treesize of output 581 [2025-01-09 22:22:17,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 549 treesize of output 525 [2025-01-09 22:22:17,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:17,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 91 [2025-01-09 22:22:17,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:17,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 61 [2025-01-09 22:22:17,369 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:17,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 55 [2025-01-09 22:22:17,380 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:17,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-09 22:22:17,435 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2025-01-09 22:22:17,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872568807] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:22:17,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:22:17,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 31 [2025-01-09 22:22:17,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134642210] [2025-01-09 22:22:17,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:22:17,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 22:22:17,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:17,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 22:22:17,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=449, Unknown=9, NotChecked=408, Total=992 [2025-01-09 22:22:17,437 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-01-09 22:22:18,069 WARN L851 $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-01-09 22:22:18,153 WARN L851 $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-01-09 22:22:18,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:18,583 INFO L93 Difference]: Finished difference Result 257 states and 282 transitions. [2025-01-09 22:22:18,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 22:22:18,583 INFO L78 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-01-09 22:22:18,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:18,584 INFO L225 Difference]: With dead ends: 257 [2025-01-09 22:22:18,584 INFO L226 Difference]: Without dead ends: 257 [2025-01-09 22:22:18,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 47 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=205, Invalid=738, Unknown=27, NotChecked=670, Total=1640 [2025-01-09 22:22:18,586 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 9 mSDsluCounter, 1588 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 2 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:18,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1747 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 841 Invalid, 30 Unknown, 855 Unchecked, 0.7s Time] [2025-01-09 22:22:18,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-01-09 22:22:18,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2025-01-09 22:22:18,591 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-01-09 22:22:18,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 282 transitions. [2025-01-09 22:22:18,592 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 282 transitions. Word has length 33 [2025-01-09 22:22:18,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:18,592 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 282 transitions. [2025-01-09 22:22:18,592 INFO L472 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-01-09 22:22:18,592 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 282 transitions. [2025-01-09 22:22:18,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 22:22:18,594 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:18,594 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-01-09 22:22:18,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 22:22:18,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:18,795 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:18,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:18,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1748340478, now seen corresponding path program 1 times [2025-01-09 22:22:18,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:18,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263635847] [2025-01-09 22:22:18,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:18,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:18,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:22:18,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:22:18,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:18,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:18,854 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 22:22:18,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:18,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263635847] [2025-01-09 22:22:18,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263635847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:18,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:18,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:22:18,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169909264] [2025-01-09 22:22:18,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:18,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:22:18,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:18,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:22:18,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:18,855 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-01-09 22:22:18,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:18,935 INFO L93 Difference]: Finished difference Result 255 states and 278 transitions. [2025-01-09 22:22:18,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:22:18,935 INFO L78 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-01-09 22:22:18,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:18,937 INFO L225 Difference]: With dead ends: 255 [2025-01-09 22:22:18,937 INFO L226 Difference]: Without dead ends: 255 [2025-01-09 22:22:18,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:18,937 INFO L435 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-01-09 22:22:18,937 INFO L436 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-01-09 22:22:18,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-01-09 22:22:18,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2025-01-09 22:22:18,941 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-01-09 22:22:18,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 278 transitions. [2025-01-09 22:22:18,942 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 278 transitions. Word has length 45 [2025-01-09 22:22:18,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:18,942 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 278 transitions. [2025-01-09 22:22:18,942 INFO L472 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-01-09 22:22:18,942 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 278 transitions. [2025-01-09 22:22:18,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 22:22:18,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:18,942 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-01-09 22:22:18,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:22:18,943 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:18,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:18,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1748340479, now seen corresponding path program 1 times [2025-01-09 22:22:18,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:18,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352016668] [2025-01-09 22:22:18,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:18,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:18,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:22:18,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:22:18,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:18,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:19,018 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:19,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:19,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352016668] [2025-01-09 22:22:19,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352016668] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:22:19,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208223450] [2025-01-09 22:22:19,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:19,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:19,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:22:19,024 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:22:19,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 22:22:19,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:22:19,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:22:19,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:19,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:19,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 22:22:19,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:22:19,144 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:19,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:22:19,205 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:19,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208223450] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:22:19,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:22:19,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-09 22:22:19,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804154475] [2025-01-09 22:22:19,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:22:19,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:22:19,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:19,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:22:19,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:22:19,207 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-01-09 22:22:19,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:19,253 INFO L93 Difference]: Finished difference Result 289 states and 314 transitions. [2025-01-09 22:22:19,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:22:19,253 INFO L78 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-01-09 22:22:19,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:19,256 INFO L225 Difference]: With dead ends: 289 [2025-01-09 22:22:19,256 INFO L226 Difference]: Without dead ends: 289 [2025-01-09 22:22:19,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:22:19,256 INFO L435 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-01-09 22:22:19,256 INFO L436 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-01-09 22:22:19,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-01-09 22:22:19,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2025-01-09 22:22:19,260 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-01-09 22:22:19,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 314 transitions. [2025-01-09 22:22:19,261 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 314 transitions. Word has length 45 [2025-01-09 22:22:19,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:19,261 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 314 transitions. [2025-01-09 22:22:19,261 INFO L472 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-01-09 22:22:19,261 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 314 transitions. [2025-01-09 22:22:19,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 22:22:19,262 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:19,262 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-01-09 22:22:19,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 22:22:19,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 22:22:19,462 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-09 22:22:19,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:19,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1609054798, now seen corresponding path program 3 times [2025-01-09 22:22:19,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:19,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615022481] [2025-01-09 22:22:19,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:22:19,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:19,473 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 7 equivalence classes. [2025-01-09 22:22:19,521 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:22:19,522 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-09 22:22:19,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:20,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:20,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615022481] [2025-01-09 22:22:20,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615022481] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:22:20,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557741395] [2025-01-09 22:22:20,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:22:20,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:20,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:22:20,328 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:22:20,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 22:22:20,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 7 equivalence classes. [2025-01-09 22:22:20,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:22:20,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-09 22:22:20,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:20,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-01-09 22:22:20,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:22:20,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:22:20,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-01-09 22:22:20,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:22:20,723 INFO L378 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-01-09 22:22:20,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:22:20,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:22:20,864 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:22:20,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2025-01-09 22:22:20,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:22:20,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-09 22:22:20,980 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:22:20,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2025-01-09 22:22:20,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:22:20,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-09 22:22:21,088 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:22:21,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2025-01-09 22:22:21,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:22:21,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-09 22:22:21,216 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:22:21,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2025-01-09 22:22:21,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:22:21,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-09 22:22:21,411 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:22:21,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2025-01-09 22:22:21,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:22:21,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-09 22:22:21,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:22:21,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 22:22:21,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:22:21,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-09 22:22:21,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 22:22:21,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:22:21,774 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:21,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:22:22,168 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse2 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_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-01-09 22:22:22,208 WARN L851 $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-01-09 22:22:22,248 WARN L851 $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-01-09 22:22:22,275 WARN L851 $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-01-09 22:22:22,333 WARN L851 $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-01-09 22:22:22,378 WARN L851 $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-01-09 22:22:22,412 WARN L851 $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-01-09 22:22:26,669 WARN L851 $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_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 ((.cse1 (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_586))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse3 v_ArrVal_585) .cse4 v_ArrVal_587) (select (select (store .cse5 .cse4 v_ArrVal_588) c_create_data_~data~0.base) .cse2) v_ArrVal_590))))) (or (forall ((v_ArrVal_591 (Array Int Int))) (<= 0 (+ .cse0 20 (select (select (store .cse1 v_subst_2 v_ArrVal_591) c_create_data_~data~0.base) .cse2)))) (< (select |c_#length| v_subst_2) (+ .cse0 20 (select (select .cse1 c_create_data_~data~0.base) .cse2)))))) (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 ((.cse10 (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_586))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse2))) (let ((.cse7 (store .cse10 .cse9 v_ArrVal_588))) (let ((.cse8 (select (select .cse7 c_create_data_~data~0.base) .cse2))) (let ((.cse6 (store (store (store |c_#memory_$Pointer$#2.offset| .cse3 v_ArrVal_585) .cse9 v_ArrVal_587) .cse8 v_ArrVal_590))) (or (< (select |c_#length| v_subst_1) (+ .cse0 20 (select (select .cse6 c_create_data_~data~0.base) .cse2))) (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (<= (+ .cse0 (select (select (store .cse6 v_subst_1 v_ArrVal_591) c_create_data_~data~0.base) .cse2) 24) (select |c_#length| (select (select (store (store .cse7 .cse8 v_ArrVal_589) v_subst_1 v_ArrVal_592) c_create_data_~data~0.base) .cse2)))))))))))))) is different from false [2025-01-09 22:22:26,940 WARN L851 $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-01-09 22:22:26,987 WARN L851 $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-01-09 22:22:27,182 WARN L851 $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-01-09 22:22:27,237 WARN L851 $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-01-09 22:22:27,388 WARN L851 $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-01-09 22:22:27,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:27,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 714 treesize of output 704 [2025-01-09 22:22:27,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:27,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 694 treesize of output 404 [2025-01-09 22:22:27,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19814033 treesize of output 17120531 [2025-01-09 22:22:46,530 WARN L286 SmtUtils]: Spent 19.06s on a formula simplification. DAG size of input: 3185 DAG size of output: 780 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 22:22:46,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10669725 treesize of output 10625859 [2025-01-09 22:22:47,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9547 treesize of output 9459 [2025-01-09 22:22:47,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9459 treesize of output 9355 [2025-01-09 22:22:47,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9355 treesize of output 8475 [2025-01-09 22:22:47,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8475 treesize of output 7867 [2025-01-09 22:22:47,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7867 treesize of output 7347 [2025-01-09 22:22:47,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4890 treesize of output 4402 [2025-01-09 22:22:48,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6859 treesize of output 6379 [2025-01-09 22:22:48,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6379 treesize of output 6315 [2025-01-09 22:22:48,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6315 treesize of output 5891 [2025-01-09 22:22:48,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5605 treesize of output 5541 [2025-01-09 22:22:59,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:59,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1068 treesize of output 1058 [2025-01-09 22:22:59,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:59,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1048 treesize of output 598 [2025-01-09 22:22:59,745 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:59,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 832843 treesize of output 740683 [2025-01-09 22:22:59,860 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:59,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 85 [2025-01-09 22:22:59,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-01-09 22:22:59,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-09 22:22:59,938 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 86 not checked. [2025-01-09 22:22:59,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557741395] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:22:59,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:22:59,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 23] total 57 [2025-01-09 22:22:59,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249604937] [2025-01-09 22:22:59,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:22:59,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-01-09 22:22:59,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:59,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-01-09 22:22:59,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=1675, Unknown=20, NotChecked=1274, Total=3306 [2025-01-09 22:22:59,941 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-01-09 22:23:06,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 22:23:21,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 22:23:25,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 22:23:27,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 22:23:28,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 22:23:29,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 22:23:33,981 WARN L539 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-01-09 22:23:37,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 22:23:41,186 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (let ((.cse4 (+ .cse9 .cse2 8)) (.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 ((|create_data_#t~mem8.base| Int)) (or (< (select |c_#length| |create_data_#t~mem8.base|) .cse4) (forall ((v_ArrVal_591 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |create_data_#t~mem8.base| v_ArrVal_591) c_create_data_~data~0.base) .cse1) .cse2 8))))) (<= .cse4 (select |c_#length| .cse3)) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_subst_1 Int)) (let ((.cse5 (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 .cse5 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 .cse5 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) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_588))) (let ((.cse8 (select (select .cse7 c_create_data_~data~0.base) .cse1))) (let ((.cse6 (store (store |c_#memory_$Pointer$#2.offset| .cse3 v_ArrVal_587) .cse8 v_ArrVal_590))) (or (< (select |c_#length| v_subst_1) (+ 16 .cse2 (select (select .cse6 c_create_data_~data~0.base) .cse1))) (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (<= (+ (select (select (store .cse6 v_subst_1 v_ArrVal_591) c_create_data_~data~0.base) .cse1) .cse2 20) (select |c_#length| (select (select (store (store .cse7 .cse8 v_ArrVal_589) v_subst_1 v_ArrVal_592) c_create_data_~data~0.base) .cse1))))))))) (<= 0 (+ .cse9 .cse2 4)) (forall ((|create_data_#t~mem8.base| Int)) (or (< (select |c_#length| |create_data_#t~mem8.base|) .cse4) (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |create_data_#t~mem8.base| v_ArrVal_591) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |create_data_#t~mem8.base| 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 ((.cse10 (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) .cse1) 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) .cse1) 16 .cse2))) (< (select |c_#length| v_subst_2) (+ 16 .cse2 (select (select .cse10 c_create_data_~data~0.base) .cse1)))))))))) is different from false [2025-01-09 22:23:41,222 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1)) (.cse4 (+ .cse7 .cse2 4))) (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 ((|create_data_#t~mem8.base| Int)) (or (forall ((v_ArrVal_591 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |create_data_#t~mem8.base| v_ArrVal_591) c_create_data_~data~0.base) .cse1) .cse2 4))) (< (select |c_#length| |create_data_#t~mem8.base|) .cse4))) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_subst_1 Int)) (let ((.cse5 (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 .cse5 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 .cse5 c_create_data_~data~0.base) .cse1) .cse2 8))))) (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| .cse3 v_ArrVal_587) (select (select (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_588) c_create_data_~data~0.base) .cse1) v_ArrVal_590))) (or (< (select |c_#length| v_subst_2) (+ .cse2 12 (select (select .cse6 c_create_data_~data~0.base) .cse1))) (forall ((v_ArrVal_591 (Array Int Int))) (<= 0 (+ (select (select (store .cse6 v_subst_2 v_ArrVal_591) c_create_data_~data~0.base) .cse1) .cse2 12)))))) (<= 0 (+ .cse7 .cse2)) (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 ((.cse9 (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_588))) (let ((.cse10 (select (select .cse9 c_create_data_~data~0.base) .cse1))) (let ((.cse8 (store (store |c_#memory_$Pointer$#2.offset| .cse3 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) 16 .cse2) (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 12 (select (select .cse8 c_create_data_~data~0.base) .cse1)))))))) (<= .cse4 (select |c_#length| .cse3)) (forall ((|create_data_#t~mem8.base| Int)) (or (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |create_data_#t~mem8.base| v_ArrVal_591) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |create_data_#t~mem8.base| v_ArrVal_592) c_create_data_~data~0.base) .cse1)))) (< (select |c_#length| |create_data_#t~mem8.base|) .cse4))))))) is different from false [2025-01-09 22:23:41,258 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_create_data_~counter~0 4))) (let ((.cse0 (+ c_create_data_~data~0.offset 4)) (.cse2 (+ |c_create_data_#t~mem8.offset| .cse1 4))) (and (forall ((|create_data_#t~mem8.base| Int)) (or (forall ((v_ArrVal_591 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |create_data_#t~mem8.base| v_ArrVal_591) c_create_data_~data~0.base) .cse0) .cse1 4))) (< (select |c_#length| |create_data_#t~mem8.base|) .cse2))) (forall ((|create_data_#t~mem8.base| Int)) (or (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |create_data_#t~mem8.base| v_ArrVal_591) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |create_data_#t~mem8.base| v_ArrVal_592) c_create_data_~data~0.base) .cse0)))) (< (select |c_#length| |create_data_#t~mem8.base|) .cse2))) (forall ((v_ArrVal_590 (Array Int Int)) (v_subst_2 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_590))) (or (forall ((v_ArrVal_591 (Array Int Int))) (<= 0 (+ .cse1 (select (select (store .cse3 v_subst_2 v_ArrVal_591) c_create_data_~data~0.base) .cse0) 8))) (< (select |c_#length| v_subst_2) (+ (select (select .cse3 c_create_data_~data~0.base) .cse0) .cse1 8))))) (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| |c_create_data_#t~mem8.base| v_ArrVal_588))) (let ((.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse0))) (let ((.cse4 (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_587) .cse6 v_ArrVal_590))) (or (< (select |c_#length| v_subst_1) (+ (select (select .cse4 c_create_data_~data~0.base) .cse0) .cse1 12)) (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) .cse0) 16 .cse1) (select |c_#length| (select (select (store (store .cse5 .cse6 v_ArrVal_589) v_subst_1 v_ArrVal_592) c_create_data_~data~0.base) .cse0))))))))) (forall ((v_ArrVal_590 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_588 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse7 (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) .cse0) v_ArrVal_590))) (or (forall ((v_ArrVal_591 (Array Int Int))) (<= 0 (+ (select (select (store .cse7 v_subst_2 v_ArrVal_591) c_create_data_~data~0.base) .cse0) .cse1 12))) (< (select |c_#length| v_subst_2) (+ (select (select .cse7 c_create_data_~data~0.base) .cse0) .cse1 12))))) (<= 0 (+ |c_create_data_#t~mem8.offset| .cse1)) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_subst_1 Int)) (let ((.cse8 (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_590))) (or (< (select |c_#length| v_subst_1) (+ (select (select .cse8 c_create_data_~data~0.base) .cse0) .cse1 8)) (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (<= (+ .cse1 12 (select (select (store .cse8 v_subst_1 v_ArrVal_591) c_create_data_~data~0.base) .cse0)) (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) .cse0))))))) (<= .cse2 (select |c_#length| |c_create_data_#t~mem8.base|))))) is different from false [2025-01-09 22:23:45,805 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1)) (.cse4 (+ .cse6 .cse2 8))) (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 ((|create_data_#t~mem8.base| Int)) (or (< (select |c_#length| |create_data_#t~mem8.base|) .cse4) (forall ((v_ArrVal_591 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |create_data_#t~mem8.base| v_ArrVal_591) c_create_data_~data~0.base) .cse1) .cse2 8))))) (<= .cse4 (select |c_#length| .cse3)) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_subst_1 Int)) (let ((.cse5 (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 .cse5 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 .cse5 c_create_data_~data~0.base) .cse1) .cse2 12))))) (<= 0 (+ .cse6 .cse2 4)) (forall ((|create_data_#t~mem8.base| Int)) (or (< (select |c_#length| |create_data_#t~mem8.base|) .cse4) (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |create_data_#t~mem8.base| v_ArrVal_591) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |create_data_#t~mem8.base| v_ArrVal_592) c_create_data_~data~0.base) .cse1)))))))))) is different from false [2025-01-09 22:23:45,891 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1)) (.cse4 (+ .cse6 .cse2 4))) (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 ((|create_data_#t~mem8.base| Int)) (or (forall ((v_ArrVal_591 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |create_data_#t~mem8.base| v_ArrVal_591) c_create_data_~data~0.base) .cse1) .cse2 4))) (< (select |c_#length| |create_data_#t~mem8.base|) .cse4))) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (v_subst_1 Int)) (let ((.cse5 (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 .cse5 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 .cse5 c_create_data_~data~0.base) .cse1) .cse2 8))))) (<= 0 (+ .cse6 .cse2)) (<= .cse4 (select |c_#length| .cse3)) (forall ((|create_data_#t~mem8.base| Int)) (or (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |create_data_#t~mem8.base| v_ArrVal_591) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |create_data_#t~mem8.base| v_ArrVal_592) c_create_data_~data~0.base) .cse1)))) (< (select |c_#length| |create_data_#t~mem8.base|) .cse4))))))) is different from false [2025-01-09 22:23:45,928 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_create_data_~counter~0 4))) (let ((.cse0 (+ c_create_data_~data~0.offset 4)) (.cse2 (+ |c_create_data_#t~mem8.offset| .cse1 4))) (and (forall ((|create_data_#t~mem8.base| Int)) (or (forall ((v_ArrVal_591 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |create_data_#t~mem8.base| v_ArrVal_591) c_create_data_~data~0.base) .cse0) .cse1 4))) (< (select |c_#length| |create_data_#t~mem8.base|) .cse2))) (forall ((|create_data_#t~mem8.base| Int)) (or (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |create_data_#t~mem8.base| v_ArrVal_591) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |create_data_#t~mem8.base| v_ArrVal_592) c_create_data_~data~0.base) .cse0)))) (< (select |c_#length| |create_data_#t~mem8.base|) .cse2))) (forall ((v_ArrVal_590 (Array Int Int)) (v_subst_2 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_590))) (or (forall ((v_ArrVal_591 (Array Int Int))) (<= 0 (+ .cse1 (select (select (store .cse3 v_subst_2 v_ArrVal_591) c_create_data_~data~0.base) .cse0) 8))) (< (select |c_#length| v_subst_2) (+ (select (select .cse3 c_create_data_~data~0.base) .cse0) .cse1 8))))) (<= 0 (+ |c_create_data_#t~mem8.offset| .cse1)) (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| |c_create_data_#t~mem8.base| v_ArrVal_590))) (or (< (select |c_#length| v_subst_1) (+ (select (select .cse4 c_create_data_~data~0.base) .cse0) .cse1 8)) (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (<= (+ .cse1 12 (select (select (store .cse4 v_subst_1 v_ArrVal_591) c_create_data_~data~0.base) .cse0)) (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) .cse0))))))) (<= .cse2 (select |c_#length| |c_create_data_#t~mem8.base|))))) is different from false [2025-01-09 22:23:45,957 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (let ((.cse0 (+ .cse3 .cse2 8))) (and (forall ((|create_data_#t~mem8.base| Int)) (or (< (select |c_#length| |create_data_#t~mem8.base|) .cse0) (forall ((v_ArrVal_591 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |create_data_#t~mem8.base| v_ArrVal_591) c_create_data_~data~0.base) .cse1) .cse2 8))))) (<= .cse0 (select |c_#length| (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (<= 0 (+ .cse3 .cse2 4)) (forall ((|create_data_#t~mem8.base| Int)) (or (< (select |c_#length| |create_data_#t~mem8.base|) .cse0) (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |create_data_#t~mem8.base| v_ArrVal_591) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |create_data_#t~mem8.base| v_ArrVal_592) c_create_data_~data~0.base) .cse1)))))))))) is different from false [2025-01-09 22:23:45,987 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_create_data_~data~0.offset 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse0)) (.cse1 (* c_create_data_~counter~0 4))) (let ((.cse2 (+ .cse3 .cse1 4))) (and (forall ((|create_data_#t~mem8.base| Int)) (or (forall ((v_ArrVal_591 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |create_data_#t~mem8.base| v_ArrVal_591) c_create_data_~data~0.base) .cse0) .cse1 4))) (< (select |c_#length| |create_data_#t~mem8.base|) .cse2))) (<= 0 (+ .cse3 .cse1)) (<= .cse2 (select |c_#length| (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse0))) (forall ((|create_data_#t~mem8.base| Int)) (or (forall ((v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |create_data_#t~mem8.base| v_ArrVal_591) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |create_data_#t~mem8.base| v_ArrVal_592) c_create_data_~data~0.base) .cse0)))) (< (select |c_#length| |create_data_#t~mem8.base|) .cse2))))))) is different from false