./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test01-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test01-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 98f2158e91ef1be5383bc6118bee8dde93a36c3837bc7feabd7dbbfea008efcf --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:22:56,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:22:56,812 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:22:56,817 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:22:56,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:22:56,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:22:56,836 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:22:56,836 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:22:56,837 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:22:56,837 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:22:56,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:22:56,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:22:56,837 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:22:56,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:22:56,837 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:22:56,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:22:56,838 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:22:56,838 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:22:56,838 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:22:56,838 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:22:56,838 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:22:56,838 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:22:56,838 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:22:56,838 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:22:56,838 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:22:56,838 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:22:56,839 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:22:56,839 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:22:56,839 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:22:56,839 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:22:56,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:22:56,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:22:56,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:22:56,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:56,839 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:22:56,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:22:56,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:22:56,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:22:56,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:56,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:22:56,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:22:56,840 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:22:56,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:22:56,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:22:56,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:22:56,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:22:56,840 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 98f2158e91ef1be5383bc6118bee8dde93a36c3837bc7feabd7dbbfea008efcf [2025-04-29 11:22:57,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:22:57,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:22:57,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:22:57,144 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:22:57,145 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:22:57,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test01-1.c [2025-04-29 11:22:58,434 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf237028/d65dc7dbb4714402b1710789f96ee93b/FLAGd578b5038 [2025-04-29 11:22:58,671 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:22:58,671 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test01-1.c [2025-04-29 11:22:58,672 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:22:58,673 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:22:58,679 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf237028/d65dc7dbb4714402b1710789f96ee93b/FLAGd578b5038 [2025-04-29 11:22:59,636 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf237028/d65dc7dbb4714402b1710789f96ee93b [2025-04-29 11:22:59,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:22:59,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:22:59,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:22:59,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:22:59,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:22:59,644 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:22:59" (1/1) ... [2025-04-29 11:22:59,645 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1925ccfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:59, skipping insertion in model container [2025-04-29 11:22:59,645 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:22:59" (1/1) ... [2025-04-29 11:22:59,654 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:22:59,806 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-29 11:22:59,840 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:22:59,849 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:22:59,879 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:22:59,890 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:22:59,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:59 WrapperNode [2025-04-29 11:22:59,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:22:59,891 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:22:59,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:22:59,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:22:59,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:59" (1/1) ... [2025-04-29 11:22:59,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:59" (1/1) ... [2025-04-29 11:22:59,916 INFO L138 Inliner]: procedures = 17, calls = 58, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2025-04-29 11:22:59,916 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:22:59,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:22:59,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:22:59,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:22:59,925 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:59" (1/1) ... [2025-04-29 11:22:59,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:59" (1/1) ... [2025-04-29 11:22:59,931 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:59" (1/1) ... [2025-04-29 11:22:59,954 INFO L175 MemorySlicer]: Split 42 memory accesses to 2 slices as follows [11, 31]. 74 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0]. The 18 writes are split as follows [2, 16]. [2025-04-29 11:22:59,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:59" (1/1) ... [2025-04-29 11:22:59,954 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:59" (1/1) ... [2025-04-29 11:22:59,961 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:59" (1/1) ... [2025-04-29 11:22:59,962 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:59" (1/1) ... [2025-04-29 11:22:59,969 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:59" (1/1) ... [2025-04-29 11:22:59,970 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:59" (1/1) ... [2025-04-29 11:22:59,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:59" (1/1) ... [2025-04-29 11:22:59,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:22:59,976 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:22:59,978 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:22:59,978 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:22:59,979 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:59" (1/1) ... [2025-04-29 11:22:59,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:22:59,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:00,011 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:23:00,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:23:00,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:23:00,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:23:00,031 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2025-04-29 11:23:00,032 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2025-04-29 11:23:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:23:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:23:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:23:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:23:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:23:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:23:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:23:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:23:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:23:00,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:23:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:23:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:23:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:23:00,102 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:23:00,104 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:23:00,516 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2025-04-29 11:23:00,518 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:23:00,527 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:23:00,529 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-29 11:23:00,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:23:00 BoogieIcfgContainer [2025-04-29 11:23:00,530 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:23:00,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:23:00,531 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:23:00,534 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:23:00,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:22:59" (1/3) ... [2025-04-29 11:23:00,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39402af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:23:00, skipping insertion in model container [2025-04-29 11:23:00,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:22:59" (2/3) ... [2025-04-29 11:23:00,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39402af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:23:00, skipping insertion in model container [2025-04-29 11:23:00,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:23:00" (3/3) ... [2025-04-29 11:23:00,538 INFO L128 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.c [2025-04-29 11:23:00,549 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:23:00,550 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG complex_data_creation_test01-1.c that has 2 procedures, 193 locations, 210 edges, 1 initial locations, 4 loop locations, and 92 error locations. [2025-04-29 11:23:00,586 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:23:00,595 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@45177a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:23:00,596 INFO L341 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2025-04-29 11:23:00,601 INFO L278 IsEmpty]: Start isEmpty. Operand has 193 states, 97 states have (on average 2.1030927835051547) internal successors, (204), 189 states have internal predecessors, (204), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:23:00,604 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-29 11:23:00,605 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:00,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-29 11:23:00,606 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-29 11:23:00,609 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:00,610 INFO L85 PathProgramCache]: Analyzing trace with hash 4742853, now seen corresponding path program 1 times [2025-04-29 11:23:00,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:00,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637400602] [2025-04-29 11:23:00,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:00,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:00,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-29 11:23:00,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-29 11:23:00,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:00,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:00,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-04-29 11:23:00,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:00,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637400602] [2025-04-29 11:23:00,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637400602] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:00,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:00,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:23:00,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556547349] [2025-04-29 11:23:00,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:00,901 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:23:00,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:00,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:23:00,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:23:00,918 INFO L87 Difference]: Start difference. First operand has 193 states, 97 states have (on average 2.1030927835051547) internal successors, (204), 189 states have internal predecessors, (204), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:01,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:01,141 INFO L93 Difference]: Finished difference Result 187 states and 199 transitions. [2025-04-29 11:23:01,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:23:01,142 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-04-29 11:23:01,142 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:01,146 INFO L225 Difference]: With dead ends: 187 [2025-04-29 11:23:01,147 INFO L226 Difference]: Without dead ends: 185 [2025-04-29 11:23:01,148 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:23:01,149 INFO L437 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-04-29 11:23:01,150 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 316 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:23:01,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-04-29 11:23:01,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-04-29 11:23:01,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 96 states have (on average 2.0104166666666665) internal successors, (193), 181 states have internal predecessors, (193), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:23:01,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2025-04-29 11:23:01,183 INFO L79 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 4 [2025-04-29 11:23:01,184 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:01,184 INFO L485 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2025-04-29 11:23:01,184 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:01,184 INFO L278 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2025-04-29 11:23:01,184 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-29 11:23:01,184 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:01,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-29 11:23:01,184 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:23:01,185 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-29 11:23:01,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:01,185 INFO L85 PathProgramCache]: Analyzing trace with hash 4742854, now seen corresponding path program 1 times [2025-04-29 11:23:01,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:01,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026041761] [2025-04-29 11:23:01,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:01,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:01,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-29 11:23:01,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-29 11:23:01,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:01,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:01,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:01,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:01,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026041761] [2025-04-29 11:23:01,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026041761] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:01,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:01,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:23:01,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459838871] [2025-04-29 11:23:01,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:01,286 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:23:01,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:01,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:23:01,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:23:01,287 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:01,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:01,463 INFO L93 Difference]: Finished difference Result 201 states and 216 transitions. [2025-04-29 11:23:01,464 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:23:01,464 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-04-29 11:23:01,464 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:01,467 INFO L225 Difference]: With dead ends: 201 [2025-04-29 11:23:01,469 INFO L226 Difference]: Without dead ends: 201 [2025-04-29 11:23:01,469 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:23:01,469 INFO L437 NwaCegarLoop]: 188 mSDtfsCounter, 28 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:01,470 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 389 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:23:01,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-04-29 11:23:01,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 190. [2025-04-29 11:23:01,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 101 states have (on average 1.9801980198019802) internal successors, (200), 186 states have internal predecessors, (200), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:23:01,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 204 transitions. [2025-04-29 11:23:01,483 INFO L79 Accepts]: Start accepts. Automaton has 190 states and 204 transitions. Word has length 4 [2025-04-29 11:23:01,483 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:01,483 INFO L485 AbstractCegarLoop]: Abstraction has 190 states and 204 transitions. [2025-04-29 11:23:01,483 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:01,483 INFO L278 IsEmpty]: Start isEmpty. Operand 190 states and 204 transitions. [2025-04-29 11:23:01,483 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:23:01,484 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:01,484 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:23:01,484 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:23:01,484 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-29 11:23:01,484 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:01,487 INFO L85 PathProgramCache]: Analyzing trace with hash 147028547, now seen corresponding path program 1 times [2025-04-29 11:23:01,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:01,487 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003444624] [2025-04-29 11:23:01,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:01,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:01,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:23:01,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:23:01,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:01,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:01,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:01,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:01,542 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003444624] [2025-04-29 11:23:01,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003444624] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:01,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:01,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:23:01,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809732465] [2025-04-29 11:23:01,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:01,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:23:01,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:01,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:23:01,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:01,543 INFO L87 Difference]: Start difference. First operand 190 states and 204 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:01,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:01,640 INFO L93 Difference]: Finished difference Result 188 states and 201 transitions. [2025-04-29 11:23:01,641 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:23:01,642 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-29 11:23:01,642 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:01,642 INFO L225 Difference]: With dead ends: 188 [2025-04-29 11:23:01,643 INFO L226 Difference]: Without dead ends: 188 [2025-04-29 11:23:01,643 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:01,643 INFO L437 NwaCegarLoop]: 185 mSDtfsCounter, 15 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:01,644 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 275 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:01,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-04-29 11:23:01,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-04-29 11:23:01,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 101 states have (on average 1.9504950495049505) internal successors, (197), 184 states have internal predecessors, (197), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:23:01,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2025-04-29 11:23:01,652 INFO L79 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 5 [2025-04-29 11:23:01,652 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:01,652 INFO L485 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2025-04-29 11:23:01,652 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:01,652 INFO L278 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2025-04-29 11:23:01,652 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:23:01,652 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:01,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:23:01,653 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:23:01,653 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-29 11:23:01,653 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:01,653 INFO L85 PathProgramCache]: Analyzing trace with hash 147028548, now seen corresponding path program 1 times [2025-04-29 11:23:01,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:01,653 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457221050] [2025-04-29 11:23:01,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:01,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:01,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:23:01,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:23:01,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:01,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:01,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-04-29 11:23:01,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:01,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457221050] [2025-04-29 11:23:01,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457221050] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:01,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:01,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:23:01,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838088414] [2025-04-29 11:23:01,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:01,718 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:23:01,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:01,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:23:01,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:01,718 INFO L87 Difference]: Start difference. First operand 188 states and 201 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:01,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:01,810 INFO L93 Difference]: Finished difference Result 186 states and 198 transitions. [2025-04-29 11:23:01,811 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:23:01,811 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-29 11:23:01,811 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:01,812 INFO L225 Difference]: With dead ends: 186 [2025-04-29 11:23:01,812 INFO L226 Difference]: Without dead ends: 186 [2025-04-29 11:23:01,812 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:01,813 INFO L437 NwaCegarLoop]: 185 mSDtfsCounter, 11 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:01,814 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 283 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:01,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-04-29 11:23:01,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-04-29 11:23:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 101 states have (on average 1.9207920792079207) internal successors, (194), 182 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:23:01,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 198 transitions. [2025-04-29 11:23:01,826 INFO L79 Accepts]: Start accepts. Automaton has 186 states and 198 transitions. Word has length 5 [2025-04-29 11:23:01,826 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:01,826 INFO L485 AbstractCegarLoop]: Abstraction has 186 states and 198 transitions. [2025-04-29 11:23:01,826 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:01,826 INFO L278 IsEmpty]: Start isEmpty. Operand 186 states and 198 transitions. [2025-04-29 11:23:01,826 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:23:01,826 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:01,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:01,826 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:23:01,826 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-29 11:23:01,827 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:01,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1597754313, now seen corresponding path program 1 times [2025-04-29 11:23:01,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:01,827 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528749373] [2025-04-29 11:23:01,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:01,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:01,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:23:01,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:23:01,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:01,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:01,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:01,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:01,914 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528749373] [2025-04-29 11:23:01,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528749373] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:01,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:01,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:23:01,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233850982] [2025-04-29 11:23:01,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:01,914 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:23:01,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:01,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:23:01,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:23:01,915 INFO L87 Difference]: Start difference. First operand 186 states and 198 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:01,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:01,982 INFO L93 Difference]: Finished difference Result 195 states and 208 transitions. [2025-04-29 11:23:01,982 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:23:01,982 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-29 11:23:01,983 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:01,983 INFO L225 Difference]: With dead ends: 195 [2025-04-29 11:23:01,983 INFO L226 Difference]: Without dead ends: 195 [2025-04-29 11:23:01,984 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:23:01,984 INFO L437 NwaCegarLoop]: 186 mSDtfsCounter, 18 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:01,984 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 714 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:23:01,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-04-29 11:23:01,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 187. [2025-04-29 11:23:01,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 102 states have (on average 1.911764705882353) internal successors, (195), 183 states have internal predecessors, (195), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:23:01,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2025-04-29 11:23:01,991 INFO L79 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 10 [2025-04-29 11:23:01,991 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:01,991 INFO L485 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2025-04-29 11:23:01,991 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:01,991 INFO L278 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2025-04-29 11:23:01,992 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-29 11:23:01,992 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:01,992 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:01,992 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:23:01,992 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-29 11:23:01,992 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:01,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2141638496, now seen corresponding path program 1 times [2025-04-29 11:23:01,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:01,992 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703587859] [2025-04-29 11:23:01,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:01,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:02,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:23:02,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:23:02,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:02,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:02,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:02,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:02,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703587859] [2025-04-29 11:23:02,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703587859] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:02,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:02,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:23:02,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411194625] [2025-04-29 11:23:02,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:02,062 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:23:02,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:02,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:23:02,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:23:02,062 INFO L87 Difference]: Start difference. First operand 187 states and 199 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:02,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:02,085 INFO L93 Difference]: Finished difference Result 266 states and 282 transitions. [2025-04-29 11:23:02,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:23:02,085 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-29 11:23:02,086 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:02,086 INFO L225 Difference]: With dead ends: 266 [2025-04-29 11:23:02,086 INFO L226 Difference]: Without dead ends: 266 [2025-04-29 11:23:02,087 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:23:02,087 INFO L437 NwaCegarLoop]: 189 mSDtfsCounter, 83 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:02,087 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 563 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:23:02,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-04-29 11:23:02,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 230. [2025-04-29 11:23:02,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 144 states have (on average 1.9305555555555556) internal successors, (278), 225 states have internal predecessors, (278), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:23:02,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 282 transitions. [2025-04-29 11:23:02,092 INFO L79 Accepts]: Start accepts. Automaton has 230 states and 282 transitions. Word has length 12 [2025-04-29 11:23:02,092 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:02,093 INFO L485 AbstractCegarLoop]: Abstraction has 230 states and 282 transitions. [2025-04-29 11:23:02,093 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:02,093 INFO L278 IsEmpty]: Start isEmpty. Operand 230 states and 282 transitions. [2025-04-29 11:23:02,093 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:23:02,093 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:02,093 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:02,093 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:23:02,093 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-29 11:23:02,094 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:02,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1966277747, now seen corresponding path program 1 times [2025-04-29 11:23:02,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:02,094 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755928608] [2025-04-29 11:23:02,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:02,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:02,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:23:02,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:23:02,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:02,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:02,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:02,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755928608] [2025-04-29 11:23:02,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755928608] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:02,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:02,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:23:02,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091644995] [2025-04-29 11:23:02,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:02,146 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:23:02,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:02,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:23:02,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:02,147 INFO L87 Difference]: Start difference. First operand 230 states and 282 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:02,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:02,264 INFO L93 Difference]: Finished difference Result 215 states and 252 transitions. [2025-04-29 11:23:02,264 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:23:02,265 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-29 11:23:02,265 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:02,265 INFO L225 Difference]: With dead ends: 215 [2025-04-29 11:23:02,265 INFO L226 Difference]: Without dead ends: 215 [2025-04-29 11:23:02,266 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:02,266 INFO L437 NwaCegarLoop]: 140 mSDtfsCounter, 46 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:02,266 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 205 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:02,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-04-29 11:23:02,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-04-29 11:23:02,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 144 states have (on average 1.7222222222222223) internal successors, (248), 210 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:23:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 252 transitions. [2025-04-29 11:23:02,270 INFO L79 Accepts]: Start accepts. Automaton has 215 states and 252 transitions. Word has length 13 [2025-04-29 11:23:02,270 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:02,270 INFO L485 AbstractCegarLoop]: Abstraction has 215 states and 252 transitions. [2025-04-29 11:23:02,270 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:02,270 INFO L278 IsEmpty]: Start isEmpty. Operand 215 states and 252 transitions. [2025-04-29 11:23:02,270 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:23:02,270 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:02,270 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:02,271 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:23:02,271 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-29 11:23:02,271 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:02,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1966277746, now seen corresponding path program 1 times [2025-04-29 11:23:02,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:02,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508967943] [2025-04-29 11:23:02,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:02,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:02,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:23:02,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:23:02,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:02,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:02,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:02,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:02,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508967943] [2025-04-29 11:23:02,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508967943] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:02,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:02,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:23:02,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843336558] [2025-04-29 11:23:02,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:02,325 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:23:02,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:02,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:23:02,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:02,326 INFO L87 Difference]: Start difference. First operand 215 states and 252 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:02,411 INFO L93 Difference]: Finished difference Result 200 states and 222 transitions. [2025-04-29 11:23:02,411 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:23:02,411 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-29 11:23:02,411 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:02,412 INFO L225 Difference]: With dead ends: 200 [2025-04-29 11:23:02,412 INFO L226 Difference]: Without dead ends: 200 [2025-04-29 11:23:02,412 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:02,413 INFO L437 NwaCegarLoop]: 140 mSDtfsCounter, 46 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:02,413 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 208 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:02,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-04-29 11:23:02,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-04-29 11:23:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 144 states have (on average 1.5138888888888888) internal successors, (218), 195 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:23:02,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 222 transitions. [2025-04-29 11:23:02,416 INFO L79 Accepts]: Start accepts. Automaton has 200 states and 222 transitions. Word has length 13 [2025-04-29 11:23:02,416 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:02,417 INFO L485 AbstractCegarLoop]: Abstraction has 200 states and 222 transitions. [2025-04-29 11:23:02,417 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:02,417 INFO L278 IsEmpty]: Start isEmpty. Operand 200 states and 222 transitions. [2025-04-29 11:23:02,417 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:23:02,417 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:02,417 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:02,417 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:23:02,417 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-29 11:23:02,418 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:02,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1790927923, now seen corresponding path program 1 times [2025-04-29 11:23:02,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:02,418 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306734859] [2025-04-29 11:23:02,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:02,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:02,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:23:02,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:23:02,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:02,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:02,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:02,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:02,503 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306734859] [2025-04-29 11:23:02,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306734859] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:02,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:02,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:23:02,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209317162] [2025-04-29 11:23:02,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:02,504 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:23:02,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:02,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:23:02,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:23:02,505 INFO L87 Difference]: Start difference. First operand 200 states and 222 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:02,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:02,649 INFO L93 Difference]: Finished difference Result 253 states and 288 transitions. [2025-04-29 11:23:02,650 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:23:02,650 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-29 11:23:02,650 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:02,651 INFO L225 Difference]: With dead ends: 253 [2025-04-29 11:23:02,651 INFO L226 Difference]: Without dead ends: 253 [2025-04-29 11:23:02,651 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:23:02,652 INFO L437 NwaCegarLoop]: 148 mSDtfsCounter, 24 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:02,652 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 413 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:02,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-04-29 11:23:02,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 208. [2025-04-29 11:23:02,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 152 states have (on average 1.513157894736842) internal successors, (230), 203 states have internal predecessors, (230), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:23:02,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 234 transitions. [2025-04-29 11:23:02,657 INFO L79 Accepts]: Start accepts. Automaton has 208 states and 234 transitions. Word has length 18 [2025-04-29 11:23:02,657 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:02,657 INFO L485 AbstractCegarLoop]: Abstraction has 208 states and 234 transitions. [2025-04-29 11:23:02,657 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:02,657 INFO L278 IsEmpty]: Start isEmpty. Operand 208 states and 234 transitions. [2025-04-29 11:23:02,658 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:23:02,658 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:02,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:02,658 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:23:02,659 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-29 11:23:02,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:02,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1790927922, now seen corresponding path program 1 times [2025-04-29 11:23:02,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:02,660 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900314858] [2025-04-29 11:23:02,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:02,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:02,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:23:02,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:23:02,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:02,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:02,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:02,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:02,826 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900314858] [2025-04-29 11:23:02,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900314858] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:02,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:02,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:23:02,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601396700] [2025-04-29 11:23:02,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:02,827 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:23:02,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:02,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:23:02,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:23:02,827 INFO L87 Difference]: Start difference. First operand 208 states and 234 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:02,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:02,972 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2025-04-29 11:23:02,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:23:02,973 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-29 11:23:02,973 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:02,974 INFO L225 Difference]: With dead ends: 208 [2025-04-29 11:23:02,974 INFO L226 Difference]: Without dead ends: 208 [2025-04-29 11:23:02,974 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:23:02,974 INFO L437 NwaCegarLoop]: 159 mSDtfsCounter, 4 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:02,974 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 432 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:02,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-04-29 11:23:02,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2025-04-29 11:23:02,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 152 states have (on average 1.486842105263158) internal successors, (226), 203 states have internal predecessors, (226), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:23:02,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 230 transitions. [2025-04-29 11:23:02,981 INFO L79 Accepts]: Start accepts. Automaton has 208 states and 230 transitions. Word has length 18 [2025-04-29 11:23:02,982 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:02,982 INFO L485 AbstractCegarLoop]: Abstraction has 208 states and 230 transitions. [2025-04-29 11:23:02,982 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:02,982 INFO L278 IsEmpty]: Start isEmpty. Operand 208 states and 230 transitions. [2025-04-29 11:23:02,982 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 11:23:02,982 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:02,982 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:02,982 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:23:02,982 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-29 11:23:02,983 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:02,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1880080999, now seen corresponding path program 1 times [2025-04-29 11:23:02,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:02,983 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17470277] [2025-04-29 11:23:02,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:02,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:02,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:23:03,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:23:03,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:03,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:03,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:03,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:03,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17470277] [2025-04-29 11:23:03,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17470277] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:03,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429887775] [2025-04-29 11:23:03,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:03,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:03,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:03,161 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:23:03,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:23:03,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:23:03,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:23:03,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:03,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:03,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-29 11:23:03,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:03,283 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:23:03,284 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-04-29 11:23:03,309 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:23:03,378 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:03,379 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-04-29 11:23:03,406 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-04-29 11:23:03,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:23:03,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:03,530 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:03,531 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-04-29 11:23:03,534 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-04-29 11:23:03,538 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2025-04-29 11:23:03,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:03,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429887775] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:03,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:23:03,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2025-04-29 11:23:03,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111839992] [2025-04-29 11:23:03,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:03,564 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:23:03,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:03,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:23:03,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=125, Unknown=13, NotChecked=0, Total=182 [2025-04-29 11:23:03,564 INFO L87 Difference]: Start difference. First operand 208 states and 230 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:03,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:03,861 INFO L93 Difference]: Finished difference Result 209 states and 230 transitions. [2025-04-29 11:23:03,862 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:23:03,862 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-29 11:23:03,862 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:03,863 INFO L225 Difference]: With dead ends: 209 [2025-04-29 11:23:03,863 INFO L226 Difference]: Without dead ends: 209 [2025-04-29 11:23:03,863 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=125, Unknown=13, NotChecked=0, Total=182 [2025-04-29 11:23:03,865 INFO L437 NwaCegarLoop]: 147 mSDtfsCounter, 66 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:03,866 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 740 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:23:03,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-04-29 11:23:03,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2025-04-29 11:23:03,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 152 states have (on average 1.4736842105263157) internal successors, (224), 202 states have internal predecessors, (224), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:23:03,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 228 transitions. [2025-04-29 11:23:03,874 INFO L79 Accepts]: Start accepts. Automaton has 207 states and 228 transitions. Word has length 23 [2025-04-29 11:23:03,874 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:03,874 INFO L485 AbstractCegarLoop]: Abstraction has 207 states and 228 transitions. [2025-04-29 11:23:03,874 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:03,874 INFO L278 IsEmpty]: Start isEmpty. Operand 207 states and 228 transitions. [2025-04-29 11:23:03,875 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 11:23:03,875 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:03,875 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:03,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:23:04,079 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-29 11:23:04,079 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-29 11:23:04,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:04,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1880080998, now seen corresponding path program 1 times [2025-04-29 11:23:04,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:04,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040415354] [2025-04-29 11:23:04,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:04,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:04,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:23:04,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:23:04,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:04,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:04,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:04,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:04,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040415354] [2025-04-29 11:23:04,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040415354] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:04,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150078668] [2025-04-29 11:23:04,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:04,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:04,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:04,376 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:23:04,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:23:04,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:23:04,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:23:04,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:04,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:04,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-29 11:23:04,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:04,454 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-29 11:23:04,465 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-04-29 11:23:04,471 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:23:04,478 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:23:04,545 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:04,546 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-04-29 11:23:04,554 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-04-29 11:23:04,617 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-04-29 11:23:04,624 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-29 11:23:04,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:04,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:04,720 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_create_data_~counter~0 4)) (.cse0 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_220 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_220) c_create_data_~data~0.base) .cse0) .cse1 4))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_220) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem5.base| v_ArrVal_221) c_create_data_~data~0.base) .cse0)))))) is different from false [2025-04-29 11:23:04,741 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse2 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_220 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_220) c_create_data_~data~0.base) .cse1) .cse2 4))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_220) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_221) c_create_data_~data~0.base) .cse1))))))) is different from false [2025-04-29 11:23:04,759 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_220) c_create_data_~data~0.base) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_221) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_220 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_220) c_create_data_~data~0.base) .cse1) 4)))))) is different from false [2025-04-29 11:23:04,767 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:04,767 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2025-04-29 11:23:04,773 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:04,773 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2025-04-29 11:23:04,777 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2025-04-29 11:23:04,784 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 78 [2025-04-29 11:23:04,792 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-29 11:23:04,794 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:23:04,799 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:04,800 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-04-29 11:23:04,803 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:23:04,804 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-04-29 11:23:04,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-04-29 11:23:04,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150078668] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:04,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:23:04,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 18 [2025-04-29 11:23:04,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323309260] [2025-04-29 11:23:04,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:04,824 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-29 11:23:04,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:04,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-29 11:23:04,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=189, Unknown=3, NotChecked=90, Total=342 [2025-04-29 11:23:04,825 INFO L87 Difference]: Start difference. First operand 207 states and 228 transitions. Second operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:05,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:05,282 INFO L93 Difference]: Finished difference Result 217 states and 238 transitions. [2025-04-29 11:23:05,283 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:23:05,283 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-29 11:23:05,283 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:05,283 INFO L225 Difference]: With dead ends: 217 [2025-04-29 11:23:05,284 INFO L226 Difference]: Without dead ends: 217 [2025-04-29 11:23:05,284 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=235, Unknown=3, NotChecked=102, Total=420 [2025-04-29 11:23:05,284 INFO L437 NwaCegarLoop]: 158 mSDtfsCounter, 4 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 241 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:05,284 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1312 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 748 Invalid, 0 Unknown, 241 Unchecked, 0.4s Time] [2025-04-29 11:23:05,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-04-29 11:23:05,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-04-29 11:23:05,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 162 states have (on average 1.4444444444444444) internal successors, (234), 212 states have internal predecessors, (234), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:23:05,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 238 transitions. [2025-04-29 11:23:05,299 INFO L79 Accepts]: Start accepts. Automaton has 217 states and 238 transitions. Word has length 23 [2025-04-29 11:23:05,299 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:05,299 INFO L485 AbstractCegarLoop]: Abstraction has 217 states and 238 transitions. [2025-04-29 11:23:05,299 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:05,300 INFO L278 IsEmpty]: Start isEmpty. Operand 217 states and 238 transitions. [2025-04-29 11:23:05,300 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:23:05,300 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:05,300 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:05,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:23:05,500 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-29 11:23:05,501 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-29 11:23:05,501 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:05,501 INFO L85 PathProgramCache]: Analyzing trace with hash 49929038, now seen corresponding path program 2 times [2025-04-29 11:23:05,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:05,501 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477555269] [2025-04-29 11:23:05,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:23:05,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:05,511 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-29 11:23:05,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:23:05,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:23:05,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:05,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:05,864 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477555269] [2025-04-29 11:23:05,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477555269] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:05,865 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909961343] [2025-04-29 11:23:05,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:23:05,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:05,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:05,867 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:23:05,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:23:05,923 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-29 11:23:05,951 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:23:05,951 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:23:05,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:05,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-29 11:23:05,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:05,961 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-29 11:23:05,968 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-04-29 11:23:05,985 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:23:05,989 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:23:06,077 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:06,078 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-04-29 11:23:06,081 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-04-29 11:23:06,158 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:06,159 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-04-29 11:23:06,165 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-04-29 11:23:06,206 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-04-29 11:23:06,212 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-29 11:23:06,233 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:06,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:06,311 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_294) c_create_data_~data~0.base) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem5.base| v_ArrVal_295) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_294 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_294) c_create_data_~data~0.base) .cse1) 4))))) is different from false [2025-04-29 11:23:06,328 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_294 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_294) c_create_data_~data~0.base) .cse2) 4))) (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_294) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_295) c_create_data_~data~0.base) .cse2))))))) is different from false [2025-04-29 11:23:06,398 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_create_data_~counter~0 4)) (.cse0 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_292) (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem5.base| v_ArrVal_293) c_create_data_~data~0.base) .cse0) v_ArrVal_294) c_create_data_~data~0.base) .cse0) .cse1 8))) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem5.base| v_ArrVal_293))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_292) .cse2 v_ArrVal_294) c_create_data_~data~0.base) .cse0) .cse1 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_295) c_create_data_~data~0.base) .cse0)))))))) is different from false [2025-04-29 11:23:06,486 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_292) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_293) c_create_data_~data~0.base) .cse1) v_ArrVal_294) c_create_data_~data~0.base) .cse1) 8))) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_293))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_292) .cse2 v_ArrVal_294) c_create_data_~data~0.base) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_295) c_create_data_~data~0.base) .cse1))))))))) is different from false [2025-04-29 11:23:06,495 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:06,495 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2025-04-29 11:23:06,500 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:06,501 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2025-04-29 11:23:06,504 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 754 treesize of output 640 [2025-04-29 11:23:06,513 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 745 treesize of output 697 [2025-04-29 11:23:06,519 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 124 [2025-04-29 11:23:06,521 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 96 [2025-04-29 11:23:06,523 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 84 [2025-04-29 11:23:06,526 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2025-04-29 11:23:06,544 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:06,544 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2025-04-29 11:23:06,549 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:06,549 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2025-04-29 11:23:06,552 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:23:06,554 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2025-04-29 11:23:06,556 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:23:06,558 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-04-29 11:23:06,580 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2025-04-29 11:23:06,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909961343] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:06,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:23:06,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 28 [2025-04-29 11:23:06,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014042614] [2025-04-29 11:23:06,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:06,581 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-29 11:23:06,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:06,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-29 11:23:06,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=484, Unknown=13, NotChecked=196, Total=812 [2025-04-29 11:23:06,582 INFO L87 Difference]: Start difference. First operand 217 states and 238 transitions. Second operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:06,895 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| c_create_data_~data~0.base) .cse2)) (.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_294 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_294) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (<= (+ .cse0 12 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_294) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_295) c_create_data_~data~0.base) .cse2)))) (<= 0 (+ .cse3 .cse0 4)) (<= (+ .cse3 .cse0 8) (select |c_#length| .cse1))))) is different from false [2025-04-29 11:23:06,968 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| c_create_data_~data~0.base) .cse2)) (.cse1 (* c_create_data_~counter~0 4))) (and (<= 0 (+ .cse0 .cse1)) (<= (+ |c_create_data_#t~mem5.offset| .cse1 4) (select |c_#length| |c_create_data_#t~mem5.base|)) (<= (+ .cse0 .cse1 4) (select |c_#length| (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (<= 0 (+ |c_create_data_#t~mem5.offset| .cse1)) (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (<= (+ .cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_294) c_create_data_~data~0.base) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem5.base| v_ArrVal_295) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_294 (Array Int Int))) (<= 0 (+ .cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_294) c_create_data_~data~0.base) .cse2) 4)))))) is different from false [2025-04-29 11:23:06,971 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (+ c_create_data_~data~0.offset 4))) (and (<= (+ |c_create_data_#t~mem5.offset| .cse0 4) (select |c_#length| |c_create_data_#t~mem5.base|)) (<= 0 (+ |c_create_data_#t~mem5.offset| .cse0)) (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_294) c_create_data_~data~0.base) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem5.base| v_ArrVal_295) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_294 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_294) c_create_data_~data~0.base) .cse1) 4))))) is different from false [2025-04-29 11:23:07,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:07,343 INFO L93 Difference]: Finished difference Result 247 states and 272 transitions. [2025-04-29 11:23:07,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:23:07,343 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-29 11:23:07,343 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:07,344 INFO L225 Difference]: With dead ends: 247 [2025-04-29 11:23:07,344 INFO L226 Difference]: Without dead ends: 247 [2025-04-29 11:23:07,345 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=738, Unknown=22, NotChecked=448, Total=1406 [2025-04-29 11:23:07,345 INFO L437 NwaCegarLoop]: 158 mSDtfsCounter, 23 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 3 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 447 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:07,345 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1327 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 747 Invalid, 28 Unknown, 447 Unchecked, 0.5s Time] [2025-04-29 11:23:07,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-04-29 11:23:07,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2025-04-29 11:23:07,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 192 states have (on average 1.3958333333333333) internal successors, (268), 242 states have internal predecessors, (268), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:23:07,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 272 transitions. [2025-04-29 11:23:07,349 INFO L79 Accepts]: Start accepts. Automaton has 247 states and 272 transitions. Word has length 28 [2025-04-29 11:23:07,350 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:07,350 INFO L485 AbstractCegarLoop]: Abstraction has 247 states and 272 transitions. [2025-04-29 11:23:07,350 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:07,350 INFO L278 IsEmpty]: Start isEmpty. Operand 247 states and 272 transitions. [2025-04-29 11:23:07,350 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-29 11:23:07,350 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:07,350 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:07,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:23:07,555 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:07,555 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-29 11:23:07,555 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:07,555 INFO L85 PathProgramCache]: Analyzing trace with hash -639726030, now seen corresponding path program 1 times [2025-04-29 11:23:07,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:07,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363863971] [2025-04-29 11:23:07,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:07,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:07,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:23:07,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:23:07,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:07,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:07,608 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-29 11:23:07,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:07,609 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363863971] [2025-04-29 11:23:07,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363863971] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:07,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:07,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:23:07,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742398665] [2025-04-29 11:23:07,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:07,610 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:23:07,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:07,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:23:07,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:07,611 INFO L87 Difference]: Start difference. First operand 247 states and 272 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:07,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:07,680 INFO L93 Difference]: Finished difference Result 245 states and 268 transitions. [2025-04-29 11:23:07,680 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:23:07,680 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-29 11:23:07,680 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:07,681 INFO L225 Difference]: With dead ends: 245 [2025-04-29 11:23:07,681 INFO L226 Difference]: Without dead ends: 245 [2025-04-29 11:23:07,681 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:07,681 INFO L437 NwaCegarLoop]: 152 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:07,682 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 239 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:07,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-04-29 11:23:07,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2025-04-29 11:23:07,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 192 states have (on average 1.375) internal successors, (264), 240 states have internal predecessors, (264), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:23:07,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 268 transitions. [2025-04-29 11:23:07,686 INFO L79 Accepts]: Start accepts. Automaton has 245 states and 268 transitions. Word has length 40 [2025-04-29 11:23:07,686 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:07,686 INFO L485 AbstractCegarLoop]: Abstraction has 245 states and 268 transitions. [2025-04-29 11:23:07,686 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:07,686 INFO L278 IsEmpty]: Start isEmpty. Operand 245 states and 268 transitions. [2025-04-29 11:23:07,687 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-29 11:23:07,687 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:07,687 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:07,687 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:23:07,687 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-29 11:23:07,687 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:07,687 INFO L85 PathProgramCache]: Analyzing trace with hash -639726029, now seen corresponding path program 1 times [2025-04-29 11:23:07,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:07,687 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867087124] [2025-04-29 11:23:07,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:07,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:07,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:23:07,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:23:07,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:07,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:07,744 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:07,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:07,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867087124] [2025-04-29 11:23:07,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867087124] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:07,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324218827] [2025-04-29 11:23:07,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:07,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:07,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:07,746 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:23:07,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:23:07,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:23:07,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:23:07,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:07,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:07,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:23:07,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:07,853 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:07,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:07,886 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:07,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324218827] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:07,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:23:07,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-29 11:23:07,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850054511] [2025-04-29 11:23:07,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:07,887 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:23:07,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:07,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:23:07,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:23:07,888 INFO L87 Difference]: Start difference. First operand 245 states and 268 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:07,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:07,921 INFO L93 Difference]: Finished difference Result 269 states and 292 transitions. [2025-04-29 11:23:07,922 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:23:07,922 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 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 40 [2025-04-29 11:23:07,922 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:07,924 INFO L225 Difference]: With dead ends: 269 [2025-04-29 11:23:07,924 INFO L226 Difference]: Without dead ends: 269 [2025-04-29 11:23:07,924 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:23:07,925 INFO L437 NwaCegarLoop]: 156 mSDtfsCounter, 8 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:07,925 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 476 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:23:07,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-04-29 11:23:07,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2025-04-29 11:23:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 216 states have (on average 1.3333333333333333) internal successors, (288), 264 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:23:07,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 292 transitions. [2025-04-29 11:23:07,932 INFO L79 Accepts]: Start accepts. Automaton has 269 states and 292 transitions. Word has length 40 [2025-04-29 11:23:07,932 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:07,932 INFO L485 AbstractCegarLoop]: Abstraction has 269 states and 292 transitions. [2025-04-29 11:23:07,933 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:07,933 INFO L278 IsEmpty]: Start isEmpty. Operand 269 states and 292 transitions. [2025-04-29 11:23:07,933 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-29 11:23:07,934 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:07,935 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:07,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:23:08,135 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-29 11:23:08,135 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-29 11:23:08,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:08,136 INFO L85 PathProgramCache]: Analyzing trace with hash 558005914, now seen corresponding path program 3 times [2025-04-29 11:23:08,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:08,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198376972] [2025-04-29 11:23:08,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:23:08,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:08,145 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 6 equivalence classes. [2025-04-29 11:23:08,188 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:23:08,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-29 11:23:08,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:08,863 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:08,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:08,864 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198376972] [2025-04-29 11:23:08,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198376972] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:08,864 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301584742] [2025-04-29 11:23:08,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:23:08,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:08,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:08,866 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:23:08,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:23:08,924 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 6 equivalence classes. [2025-04-29 11:23:09,066 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:23:09,066 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-29 11:23:09,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:09,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-29 11:23:09,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:09,077 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-29 11:23:09,082 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-04-29 11:23:09,100 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:23:09,102 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:23:09,184 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:09,184 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-04-29 11:23:09,192 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-04-29 11:23:09,283 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:09,283 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-04-29 11:23:09,300 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-04-29 11:23:09,387 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:09,387 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-04-29 11:23:09,391 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-04-29 11:23:09,488 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:09,488 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-04-29 11:23:09,497 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-04-29 11:23:09,589 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:09,590 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-04-29 11:23:09,595 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-04-29 11:23:09,639 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-04-29 11:23:09,643 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-29 11:23:09,663 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:09,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:09,786 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_548 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_548) c_create_data_~data~0.base) .cse2) 4))) (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_549 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_548) c_create_data_~data~0.base) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_549) c_create_data_~data~0.base) .cse2))))))) is different from false [2025-04-29 11:23:09,843 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse2 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem5.base| v_ArrVal_546))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (<= (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_547) .cse1 v_ArrVal_548) c_create_data_~data~0.base) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_549) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_547) (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem5.base| v_ArrVal_546) c_create_data_~data~0.base) .cse2) v_ArrVal_548) c_create_data_~data~0.base) .cse2) 8))))) is different from false [2025-04-29 11:23:09,936 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_547) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_546) c_create_data_~data~0.base) .cse2) v_ArrVal_548) c_create_data_~data~0.base) .cse2) 12))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_546))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (<= (+ 16 .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_547) .cse3 v_ArrVal_548) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_549) c_create_data_~data~0.base) .cse2))))))))) is different from false [2025-04-29 11:23:09,951 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse3 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_544 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem5.base| v_ArrVal_545))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_546))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (<= (+ 16 .cse0 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_544) .cse1 v_ArrVal_547) .cse2 v_ArrVal_548) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_549) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_544 (Array Int Int))) (<= 0 (+ .cse0 12 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem5.base| v_ArrVal_545))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_544) .cse6 v_ArrVal_547) (select (select (store .cse7 .cse6 v_ArrVal_546) c_create_data_~data~0.base) .cse3) v_ArrVal_548))) c_create_data_~data~0.base) .cse3)))))) is different from false [2025-04-29 11:23:09,972 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse4 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_544 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_545))) (let ((.cse1 (select (select .cse2 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_544) .cse1 v_ArrVal_547) (select (select (store .cse2 .cse1 v_ArrVal_546) c_create_data_~data~0.base) .cse3) v_ArrVal_548))) c_create_data_~data~0.base) .cse3) .cse4 12))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_544 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_545))) (let ((.cse5 (select (select .cse8 c_create_data_~data~0.base) .cse3))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_546))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_544) .cse5 v_ArrVal_547) .cse6 v_ArrVal_548) c_create_data_~data~0.base) .cse3) 16 .cse4) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_549) c_create_data_~data~0.base) .cse3))))))))))) is different from false [2025-04-29 11:23:09,993 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse3)) (.cse4 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_544 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_545))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_546))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_544) .cse1 v_ArrVal_547) .cse2 v_ArrVal_548) c_create_data_~data~0.base) .cse3) .cse4 20) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_549) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_544 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_545))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_544) .cse7 v_ArrVal_547) (select (select (store .cse8 .cse7 v_ArrVal_546) c_create_data_~data~0.base) .cse3) v_ArrVal_548))) c_create_data_~data~0.base) .cse3) 16 .cse4)))))) is different from false [2025-04-29 11:23:10,012 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse4 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem5.base| v_ArrVal_542))) (let ((.cse1 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_545))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_546))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (<= (+ .cse0 20 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_543) .cse1 v_ArrVal_544) .cse2 v_ArrVal_547) .cse3 v_ArrVal_548) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_549) c_create_data_~data~0.base) .cse4)))))))))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (<= 0 (+ 16 .cse0 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem5.base| v_ArrVal_542))) (let ((.cse8 (select (select .cse11 c_create_data_~data~0.base) .cse4))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_545))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_543) .cse8 v_ArrVal_544) .cse9 v_ArrVal_547) (select (select (store .cse10 .cse9 v_ArrVal_546) c_create_data_~data~0.base) .cse4) v_ArrVal_548))))) c_create_data_~data~0.base) .cse4)))))) is different from false [2025-04-29 11:23:10,038 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_542))) (let ((.cse2 (select (select .cse8 c_create_data_~data~0.base) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_545))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_546))) (let ((.cse4 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (<= (+ .cse0 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_543) .cse2 v_ArrVal_544) .cse3 v_ArrVal_547) .cse4 v_ArrVal_548) c_create_data_~data~0.base) .cse5) 20) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_549) c_create_data_~data~0.base) .cse5)))))))))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (<= 0 (+ 16 .cse0 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_542))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse5))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_545))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse5))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_543) .cse9 v_ArrVal_544) .cse10 v_ArrVal_547) (select (select (store .cse11 .cse10 v_ArrVal_546) c_create_data_~data~0.base) .cse5) v_ArrVal_548))))) c_create_data_~data~0.base) .cse5))))))) is different from false [2025-04-29 11:23:10,075 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_542))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_545))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_543) .cse2 v_ArrVal_544) .cse3 v_ArrVal_547) (select (select (store .cse4 .cse3 v_ArrVal_546) c_create_data_~data~0.base) .cse5) v_ArrVal_548))))) c_create_data_~data~0.base) .cse5) 20))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_542))) (let ((.cse7 (select (select .cse12 c_create_data_~data~0.base) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_545))) (let ((.cse8 (select (select .cse11 c_create_data_~data~0.base) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_546))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse5))) (<= (+ .cse0 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_543) .cse7 v_ArrVal_544) .cse8 v_ArrVal_547) .cse9 v_ArrVal_548) c_create_data_~data~0.base) .cse5) 24) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_549) c_create_data_~data~0.base) .cse5))))))))))))) is different from false [2025-04-29 11:23:10,102 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse5 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem5.base| v_ArrVal_541))) (let ((.cse1 (select (select .cse9 c_create_data_~data~0.base) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_542))) (let ((.cse2 (select (select .cse8 c_create_data_~data~0.base) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_545))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_546))) (let ((.cse4 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (<= (+ .cse0 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_540) .cse1 v_ArrVal_543) .cse2 v_ArrVal_544) .cse3 v_ArrVal_547) .cse4 v_ArrVal_548) c_create_data_~data~0.base) .cse5) 24) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_549) c_create_data_~data~0.base) .cse5)))))))))))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (<= 0 (+ .cse0 20 (select (select (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem5.base| v_ArrVal_541))) (let ((.cse10 (select (select .cse15 c_create_data_~data~0.base) .cse5))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_542))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse5))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_545))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_540) .cse10 v_ArrVal_543) .cse11 v_ArrVal_544) .cse12 v_ArrVal_547) (select (select (store .cse13 .cse12 v_ArrVal_546) c_create_data_~data~0.base) .cse5) v_ArrVal_548))))))) c_create_data_~data~0.base) .cse5)))))) is different from false [2025-04-29 11:23:10,138 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse6))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_541))) (let ((.cse2 (select (select .cse10 c_create_data_~data~0.base) .cse6))) (let ((.cse9 (store .cse10 .cse2 v_ArrVal_542))) (let ((.cse3 (select (select .cse9 c_create_data_~data~0.base) .cse6))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_545))) (let ((.cse4 (select (select .cse8 c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_546))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (<= (+ .cse0 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_540) .cse2 v_ArrVal_543) .cse3 v_ArrVal_544) .cse4 v_ArrVal_547) .cse5 v_ArrVal_548) c_create_data_~data~0.base) .cse6) 24) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_549) c_create_data_~data~0.base) .cse6)))))))))))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (<= 0 (+ .cse0 20 (select (select (let ((.cse16 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_541))) (let ((.cse11 (select (select .cse16 c_create_data_~data~0.base) .cse6))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_542))) (let ((.cse12 (select (select .cse15 c_create_data_~data~0.base) .cse6))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_545))) (let ((.cse13 (select (select .cse14 c_create_data_~data~0.base) .cse6))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_540) .cse11 v_ArrVal_543) .cse12 v_ArrVal_544) .cse13 v_ArrVal_547) (select (select (store .cse14 .cse13 v_ArrVal_546) c_create_data_~data~0.base) .cse6) v_ArrVal_548))))))) c_create_data_~data~0.base) .cse6))))))) is different from false [2025-04-29 11:23:10,181 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_541))) (let ((.cse1 (select (select .cse9 c_create_data_~data~0.base) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_542))) (let ((.cse2 (select (select .cse8 c_create_data_~data~0.base) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_545))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_546))) (let ((.cse4 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_540) .cse1 v_ArrVal_543) .cse2 v_ArrVal_544) .cse3 v_ArrVal_547) .cse4 v_ArrVal_548) c_create_data_~data~0.base) .cse5) 24) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_549) c_create_data_~data~0.base) .cse5)))))))))))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_541))) (let ((.cse10 (select (select .cse15 c_create_data_~data~0.base) .cse5))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_542))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse5))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_545))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_540) .cse10 v_ArrVal_543) .cse11 v_ArrVal_544) .cse12 v_ArrVal_547) (select (select (store .cse13 .cse12 v_ArrVal_546) c_create_data_~data~0.base) .cse5) v_ArrVal_548))))))) c_create_data_~data~0.base) .cse5))))))) is different from false [2025-04-29 11:23:10,193 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:10,193 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 354 treesize of output 355 [2025-04-29 11:23:10,198 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:10,198 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 344 treesize of output 205 [2025-04-29 11:23:10,234 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1653844 treesize of output 1374778 [2025-04-29 11:23:11,576 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43662 treesize of output 43194 [2025-04-29 11:23:11,603 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 534 treesize of output 486 [2025-04-29 11:23:11,607 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 486 treesize of output 454 [2025-04-29 11:23:11,612 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 454 treesize of output 410 [2025-04-29 11:23:11,617 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 344 treesize of output 340 [2025-04-29 11:23:11,622 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 406 treesize of output 374 [2025-04-29 11:23:11,625 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 374 treesize of output 358 [2025-04-29 11:23:11,630 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 358 treesize of output 314 [2025-04-29 11:23:11,636 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 264 treesize of output 260 [2025-04-29 11:23:11,640 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 310 treesize of output 298 [2025-04-29 11:23:11,679 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:11,680 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 705 treesize of output 706 [2025-04-29 11:23:11,689 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:23:11,689 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 695 treesize of output 396 [2025-04-29 11:23:11,692 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:23:11,713 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 503764 treesize of output 402274 [2025-04-29 11:23:11,851 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:23:11,853 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-04-29 11:23:11,886 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 65 not checked. [2025-04-29 11:23:11,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301584742] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:23:11,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:23:11,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 20] total 49 [2025-04-29 11:23:11,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870045779] [2025-04-29 11:23:11,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:23:11,887 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-04-29 11:23:11,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:11,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-04-29 11:23:11,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1190, Unknown=35, NotChecked=996, Total=2450 [2025-04-29 11:23:11,888 INFO L87 Difference]: Start difference. First operand 269 states and 292 transitions. Second operand has 50 states, 49 states have (on average 2.163265306122449) internal successors, (106), 50 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:13,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:13,462 INFO L93 Difference]: Finished difference Result 275 states and 294 transitions. [2025-04-29 11:23:13,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:23:13,466 INFO L79 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.163265306122449) internal successors, (106), 50 states have internal predecessors, (106), 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 43 [2025-04-29 11:23:13,466 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:13,467 INFO L225 Difference]: With dead ends: 275 [2025-04-29 11:23:13,467 INFO L226 Difference]: Without dead ends: 275 [2025-04-29 11:23:13,468 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 978 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=492, Invalid=2251, Unknown=61, NotChecked=1356, Total=4160 [2025-04-29 11:23:13,468 INFO L437 NwaCegarLoop]: 160 mSDtfsCounter, 38 mSDsluCounter, 2308 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 9 mSolverCounterUnsat, 52 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 2468 SdHoareTripleChecker+Invalid, 2714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 52 IncrementalHoareTripleChecker+Unknown, 1313 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:13,468 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 2468 Invalid, 2714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1340 Invalid, 52 Unknown, 1313 Unchecked, 0.8s Time] [2025-04-29 11:23:13,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-04-29 11:23:13,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-04-29 11:23:13,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 222 states have (on average 1.3063063063063063) internal successors, (290), 270 states have internal predecessors, (290), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:23:13,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 294 transitions. [2025-04-29 11:23:13,474 INFO L79 Accepts]: Start accepts. Automaton has 275 states and 294 transitions. Word has length 43 [2025-04-29 11:23:13,475 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:13,475 INFO L485 AbstractCegarLoop]: Abstraction has 275 states and 294 transitions. [2025-04-29 11:23:13,475 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.163265306122449) internal successors, (106), 50 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:13,476 INFO L278 IsEmpty]: Start isEmpty. Operand 275 states and 294 transitions. [2025-04-29 11:23:13,476 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-04-29 11:23:13,478 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:13,478 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:13,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 11:23:13,679 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-29 11:23:13,679 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-29 11:23:13,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:13,680 INFO L85 PathProgramCache]: Analyzing trace with hash -2121442866, now seen corresponding path program 4 times [2025-04-29 11:23:13,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:13,680 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975362244] [2025-04-29 11:23:13,680 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:23:13,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:13,694 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-04-29 11:23:13,740 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:23:13,741 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:23:13,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:14,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:14,924 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975362244] [2025-04-29 11:23:14,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975362244] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:14,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423726941] [2025-04-29 11:23:14,925 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:23:14,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:14,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:14,927 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:23:14,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:23:14,994 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-04-29 11:23:15,326 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:23:15,326 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:23:15,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:15,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-04-29 11:23:15,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:15,342 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:23:15,349 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-04-29 11:23:15,353 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-29 11:23:15,382 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:23:15,386 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:23:15,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:23:15,511 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 49 [2025-04-29 11:23:15,518 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-04-29 11:23:15,615 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:15,615 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-04-29 11:23:15,621 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 24 [2025-04-29 11:23:15,765 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:15,765 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-04-29 11:23:15,768 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 24 [2025-04-29 11:23:15,879 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:15,880 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-04-29 11:23:15,884 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 24 [2025-04-29 11:23:16,027 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:16,027 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-04-29 11:23:16,037 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 24 [2025-04-29 11:23:16,193 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:16,194 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-04-29 11:23:16,200 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 24 [2025-04-29 11:23:16,342 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:16,342 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-04-29 11:23:16,347 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 24 [2025-04-29 11:23:16,495 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:23:16,495 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-04-29 11:23:16,499 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 24 [2025-04-29 11:23:16,567 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2025-04-29 11:23:16,570 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-04-29 11:23:16,611 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:16,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:23:16,697 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_708 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_707) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem5.base| v_ArrVal_708) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_707 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_707) c_create_data_~data~0.base) .cse1)))))) is different from false [2025-04-29 11:23:16,709 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_708 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_707) c_create_data_~data~0.base) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_708) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_707 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_707) c_create_data_~data~0.base) .cse2) 4)))))) is different from false [2025-04-29 11:23:16,719 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_708 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_707) c_create_data_~data~0.base) .cse2) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_708) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_707 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_707) c_create_data_~data~0.base) .cse2) 8)))))) is different from false [2025-04-29 11:23:16,729 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse2 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem5.base| v_ArrVal_706))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (<= (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_705) .cse1 v_ArrVal_707) c_create_data_~data~0.base) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_708) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_705) (select (select (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem5.base| v_ArrVal_706) c_create_data_~data~0.base) .cse2) v_ArrVal_707) c_create_data_~data~0.base) .cse2) 8))))) is different from false [2025-04-29 11:23:16,815 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse2)) (.cse3 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_706))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (<= (+ 16 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_705) .cse1 v_ArrVal_707) c_create_data_~data~0.base) .cse2) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_708) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_705) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_706) c_create_data_~data~0.base) .cse2) v_ArrVal_707) c_create_data_~data~0.base) .cse2) .cse3 12)))))) is different from false [2025-04-29 11:23:16,829 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_create_data_~counter~0 4)) (.cse2 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem5.base| v_ArrVal_704))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_703) .cse0 v_ArrVal_705) (select (select (store .cse1 .cse0 v_ArrVal_706) c_create_data_~data~0.base) .cse2) v_ArrVal_707))) c_create_data_~data~0.base) .cse2) .cse3 12))) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem5.base| v_ArrVal_704))) (let ((.cse4 (select (select .cse7 c_create_data_~data~0.base) .cse2))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_706))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_703) .cse4 v_ArrVal_705) .cse5 v_ArrVal_707) c_create_data_~data~0.base) .cse2) 16 .cse3) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_708) c_create_data_~data~0.base) .cse2)))))))))) is different from false [2025-04-29 11:23:17,141 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse4))) (and (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_704))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_706))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (<= (+ .cse0 20 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_703) .cse2 v_ArrVal_705) .cse3 v_ArrVal_707) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_708) c_create_data_~data~0.base) .cse4)))))))) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (<= 0 (+ 16 .cse0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_704))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_703) .cse7 v_ArrVal_705) (select (select (store .cse8 .cse7 v_ArrVal_706) c_create_data_~data~0.base) .cse4) v_ArrVal_707))) c_create_data_~data~0.base) .cse4))))))) is different from false [2025-04-29 11:23:17,162 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4)) (.cse4 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem5.base| v_ArrVal_702))) (let ((.cse0 (select (select .cse7 c_create_data_~data~0.base) .cse3))) (let ((.cse6 (store .cse7 .cse0 v_ArrVal_704))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_706))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_701) .cse0 v_ArrVal_703) .cse1 v_ArrVal_705) .cse2 v_ArrVal_707) c_create_data_~data~0.base) .cse3) .cse4 20) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_708) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (<= 0 (+ 16 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem5.base| v_ArrVal_702))) (let ((.cse8 (select (select .cse11 c_create_data_~data~0.base) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_704))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_701) .cse8 v_ArrVal_703) .cse9 v_ArrVal_705) (select (select (store .cse10 .cse9 v_ArrVal_706) c_create_data_~data~0.base) .cse3) v_ArrVal_707))))) c_create_data_~data~0.base) .cse3) .cse4))))) is different from false [2025-04-29 11:23:17,467 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (<= 0 (+ 16 .cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_702))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_704))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_701) .cse2 v_ArrVal_703) .cse3 v_ArrVal_705) (select (select (store .cse4 .cse3 v_ArrVal_706) c_create_data_~data~0.base) .cse5) v_ArrVal_707))))) c_create_data_~data~0.base) .cse5)))) (forall ((v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_702))) (let ((.cse7 (select (select .cse12 c_create_data_~data~0.base) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_704))) (let ((.cse8 (select (select .cse11 c_create_data_~data~0.base) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_706))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse5))) (<= (+ .cse0 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_701) .cse7 v_ArrVal_703) .cse8 v_ArrVal_705) .cse9 v_ArrVal_707) c_create_data_~data~0.base) .cse5) 20) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_708) c_create_data_~data~0.base) .cse5))))))))))))) is different from false [2025-04-29 11:23:31,486 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 4)) (.cse5 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem5.base| v_ArrVal_700))) (let ((.cse0 (select (select .cse9 c_create_data_~data~0.base) .cse4))) (let ((.cse8 (store .cse9 .cse0 v_ArrVal_702))) (let ((.cse1 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store .cse8 .cse1 v_ArrVal_704))) (let ((.cse2 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (let ((.cse6 (store .cse7 .cse2 v_ArrVal_706))) (let ((.cse3 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_699) .cse0 v_ArrVal_701) .cse1 v_ArrVal_703) .cse2 v_ArrVal_705) .cse3 v_ArrVal_707) c_create_data_~data~0.base) .cse4) .cse5 24) (select |c_#length| (select (select (store .cse6 .cse3 v_ArrVal_708) c_create_data_~data~0.base) .cse4)))))))))))) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem5.base| v_ArrVal_700))) (let ((.cse10 (select (select .cse15 c_create_data_~data~0.base) .cse4))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_702))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse4))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_704))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_699) .cse10 v_ArrVal_701) .cse11 v_ArrVal_703) .cse12 v_ArrVal_705) (select (select (store .cse13 .cse12 v_ArrVal_706) c_create_data_~data~0.base) .cse4) v_ArrVal_707))))))) c_create_data_~data~0.base) .cse4) .cse5 20))))) is different from false [2025-04-29 11:23:36,175 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse5)) (.cse6 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_700))) (let ((.cse1 (select (select .cse10 c_create_data_~data~0.base) .cse5))) (let ((.cse9 (store .cse10 .cse1 v_ArrVal_702))) (let ((.cse2 (select (select .cse9 c_create_data_~data~0.base) .cse5))) (let ((.cse8 (store .cse9 .cse2 v_ArrVal_704))) (let ((.cse3 (select (select .cse8 c_create_data_~data~0.base) .cse5))) (let ((.cse7 (store .cse8 .cse3 v_ArrVal_706))) (let ((.cse4 (select (select .cse7 c_create_data_~data~0.base) .cse5))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_699) .cse1 v_ArrVal_701) .cse2 v_ArrVal_703) .cse3 v_ArrVal_705) .cse4 v_ArrVal_707) c_create_data_~data~0.base) .cse5) .cse6 24) (select |c_#length| (select (select (store .cse7 .cse4 v_ArrVal_708) c_create_data_~data~0.base) .cse5)))))))))))) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse16 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_700))) (let ((.cse11 (select (select .cse16 c_create_data_~data~0.base) .cse5))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_702))) (let ((.cse12 (select (select .cse15 c_create_data_~data~0.base) .cse5))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_704))) (let ((.cse13 (select (select .cse14 c_create_data_~data~0.base) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_699) .cse11 v_ArrVal_701) .cse12 v_ArrVal_703) .cse13 v_ArrVal_705) (select (select (store .cse14 .cse13 v_ArrVal_706) c_create_data_~data~0.base) .cse5) v_ArrVal_707))))))) c_create_data_~data~0.base) .cse5) .cse6 20)))))) is different from false [2025-04-29 11:23:36,504 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_create_data_~data~0.offset 4))) (let ((.cse8 (* c_create_data_~counter~0 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_700))) (let ((.cse1 (select (select .cse7 c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_702))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_704))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_699) .cse1 v_ArrVal_701) .cse2 v_ArrVal_703) .cse3 v_ArrVal_705) (select (select (store .cse4 .cse3 v_ArrVal_706) c_create_data_~data~0.base) .cse5) v_ArrVal_707))))))) c_create_data_~data~0.base) .cse5) .cse8 24))) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_707 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_700))) (let ((.cse9 (select (select .cse16 c_create_data_~data~0.base) .cse5))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_702))) (let ((.cse10 (select (select .cse15 c_create_data_~data~0.base) .cse5))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_704))) (let ((.cse11 (select (select .cse14 c_create_data_~data~0.base) .cse5))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_706))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse5))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_699) .cse9 v_ArrVal_701) .cse10 v_ArrVal_703) .cse11 v_ArrVal_705) .cse12 v_ArrVal_707) c_create_data_~data~0.base) .cse5) .cse8 28) (select |c_#length| (select (select (store .cse13 .cse12 v_ArrVal_708) c_create_data_~data~0.base) .cse5))))))))))))))) is different from false [2025-04-29 11:23:41,696 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse6 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem5.base| v_ArrVal_698))) (let ((.cse1 (select (select .cse11 c_create_data_~data~0.base) .cse6))) (let ((.cse10 (store .cse11 .cse1 v_ArrVal_700))) (let ((.cse2 (select (select .cse10 c_create_data_~data~0.base) .cse6))) (let ((.cse9 (store .cse10 .cse2 v_ArrVal_702))) (let ((.cse3 (select (select .cse9 c_create_data_~data~0.base) .cse6))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_704))) (let ((.cse4 (select (select .cse8 c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_706))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (<= (+ .cse0 28 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_697) .cse1 v_ArrVal_699) .cse2 v_ArrVal_701) .cse3 v_ArrVal_703) .cse4 v_ArrVal_705) .cse5 v_ArrVal_707) c_create_data_~data~0.base) .cse6)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_708) c_create_data_~data~0.base) .cse6)))))))))))))) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse19 (store |c_#memory_$Pointer$#1.base| |c_create_data_#t~mem5.base| v_ArrVal_698))) (let ((.cse12 (select (select .cse19 c_create_data_~data~0.base) .cse6))) (let ((.cse18 (store .cse19 .cse12 v_ArrVal_700))) (let ((.cse13 (select (select .cse18 c_create_data_~data~0.base) .cse6))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_702))) (let ((.cse14 (select (select .cse17 c_create_data_~data~0.base) .cse6))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_704))) (let ((.cse15 (select (select .cse16 c_create_data_~data~0.base) .cse6))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_create_data_#t~mem5.base| v_ArrVal_697) .cse12 v_ArrVal_699) .cse13 v_ArrVal_701) .cse14 v_ArrVal_703) .cse15 v_ArrVal_705) (select (select (store .cse16 .cse15 v_ArrVal_706) c_create_data_~data~0.base) .cse6) v_ArrVal_707))))))))) c_create_data_~data~0.base) .cse6) 24))))) is different from false [2025-04-29 11:23:46,297 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse7))) (and (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_698))) (let ((.cse2 (select (select .cse12 c_create_data_~data~0.base) .cse7))) (let ((.cse11 (store .cse12 .cse2 v_ArrVal_700))) (let ((.cse3 (select (select .cse11 c_create_data_~data~0.base) .cse7))) (let ((.cse10 (store .cse11 .cse3 v_ArrVal_702))) (let ((.cse4 (select (select .cse10 c_create_data_~data~0.base) .cse7))) (let ((.cse9 (store .cse10 .cse4 v_ArrVal_704))) (let ((.cse5 (select (select .cse9 c_create_data_~data~0.base) .cse7))) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_706))) (let ((.cse6 (select (select .cse8 c_create_data_~data~0.base) .cse7))) (<= (+ .cse0 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_697) .cse2 v_ArrVal_699) .cse3 v_ArrVal_701) .cse4 v_ArrVal_703) .cse5 v_ArrVal_705) .cse6 v_ArrVal_707) c_create_data_~data~0.base) .cse7) 28) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_708) c_create_data_~data~0.base) .cse7)))))))))))))) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse20 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_698))) (let ((.cse13 (select (select .cse20 c_create_data_~data~0.base) .cse7))) (let ((.cse19 (store .cse20 .cse13 v_ArrVal_700))) (let ((.cse14 (select (select .cse19 c_create_data_~data~0.base) .cse7))) (let ((.cse18 (store .cse19 .cse14 v_ArrVal_702))) (let ((.cse15 (select (select .cse18 c_create_data_~data~0.base) .cse7))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_704))) (let ((.cse16 (select (select .cse17 c_create_data_~data~0.base) .cse7))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_697) .cse13 v_ArrVal_699) .cse14 v_ArrVal_701) .cse15 v_ArrVal_703) .cse16 v_ArrVal_705) (select (select (store .cse17 .cse16 v_ArrVal_706) c_create_data_~data~0.base) .cse7) v_ArrVal_707))))))))) c_create_data_~data~0.base) .cse7) 24)))))) is different from false [2025-04-29 11:23:47,012 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_create_data_~data~0.base) .cse7))) (and (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_698))) (let ((.cse2 (select (select .cse12 c_create_data_~data~0.base) .cse7))) (let ((.cse11 (store .cse12 .cse2 v_ArrVal_700))) (let ((.cse3 (select (select .cse11 c_create_data_~data~0.base) .cse7))) (let ((.cse10 (store .cse11 .cse3 v_ArrVal_702))) (let ((.cse4 (select (select .cse10 c_create_data_~data~0.base) .cse7))) (let ((.cse9 (store .cse10 .cse4 v_ArrVal_704))) (let ((.cse5 (select (select .cse9 c_create_data_~data~0.base) .cse7))) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_706))) (let ((.cse6 (select (select .cse8 c_create_data_~data~0.base) .cse7))) (<= (+ 32 .cse0 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_697) .cse2 v_ArrVal_699) .cse3 v_ArrVal_701) .cse4 v_ArrVal_703) .cse5 v_ArrVal_705) .cse6 v_ArrVal_707) c_create_data_~data~0.base) .cse7)) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_708) c_create_data_~data~0.base) .cse7)))))))))))))) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse20 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_698))) (let ((.cse13 (select (select .cse20 c_create_data_~data~0.base) .cse7))) (let ((.cse19 (store .cse20 .cse13 v_ArrVal_700))) (let ((.cse14 (select (select .cse19 c_create_data_~data~0.base) .cse7))) (let ((.cse18 (store .cse19 .cse14 v_ArrVal_702))) (let ((.cse15 (select (select .cse18 c_create_data_~data~0.base) .cse7))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_704))) (let ((.cse16 (select (select .cse17 c_create_data_~data~0.base) .cse7))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_697) .cse13 v_ArrVal_699) .cse14 v_ArrVal_701) .cse15 v_ArrVal_703) .cse16 v_ArrVal_705) (select (select (store .cse17 .cse16 v_ArrVal_706) c_create_data_~data~0.base) .cse7) v_ArrVal_707))))))))) c_create_data_~data~0.base) .cse7) 28)))))) is different from false Killed by 15