./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:46:24,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:46:24,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:46:24,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:46:24,450 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:46:24,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:46:24,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:46:24,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:46:24,482 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:46:24,483 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:46:24,483 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:46:24,483 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:46:24,484 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:46:24,484 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:46:24,485 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:46:24,485 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:46:24,485 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:46:24,486 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:46:24,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:46:24,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:46:24,487 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:46:24,487 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:46:24,488 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:46:24,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:46:24,488 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:46:24,488 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:46:24,489 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:46:24,489 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:46:24,489 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:46:24,490 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:46:24,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:46:24,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:46:24,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:46:24,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:46:24,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:46:24,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:46:24,492 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:46:24,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:46:24,492 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:46:24,493 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:46:24,493 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:46:24,493 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:46:24,493 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df [2024-11-09 07:46:24,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:46:24,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:46:24,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:46:24,807 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:46:24,808 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:46:24,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2024-11-09 07:46:26,230 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:46:26,481 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:46:26,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2024-11-09 07:46:26,493 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc56d6278/325693af39d14d36a406d85f629cf40c/FLAG92f9cf15b [2024-11-09 07:46:26,508 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc56d6278/325693af39d14d36a406d85f629cf40c [2024-11-09 07:46:26,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:46:26,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:46:26,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:46:26,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:46:26,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:46:26,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:46:26" (1/1) ... [2024-11-09 07:46:26,518 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d497438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:26, skipping insertion in model container [2024-11-09 07:46:26,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:46:26" (1/1) ... [2024-11-09 07:46:26,561 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:46:26,882 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:46:26,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:46:26,928 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:46:26,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:46:27,019 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:46:27,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:27 WrapperNode [2024-11-09 07:46:27,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:46:27,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:46:27,022 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:46:27,022 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:46:27,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:27" (1/1) ... [2024-11-09 07:46:27,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:27" (1/1) ... [2024-11-09 07:46:27,074 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2024-11-09 07:46:27,076 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:46:27,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:46:27,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:46:27,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:46:27,088 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:27" (1/1) ... [2024-11-09 07:46:27,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:27" (1/1) ... [2024-11-09 07:46:27,092 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:27" (1/1) ... [2024-11-09 07:46:27,130 INFO L175 MemorySlicer]: Split 44 memory accesses to 3 slices as follows [2, 11, 31]. 70 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 18 writes are split as follows [0, 2, 16]. [2024-11-09 07:46:27,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:27" (1/1) ... [2024-11-09 07:46:27,131 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:27" (1/1) ... [2024-11-09 07:46:27,147 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:27" (1/1) ... [2024-11-09 07:46:27,158 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:27" (1/1) ... [2024-11-09 07:46:27,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:27" (1/1) ... [2024-11-09 07:46:27,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:27" (1/1) ... [2024-11-09 07:46:27,172 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:46:27,173 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:46:27,174 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:46:27,174 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:46:27,175 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:27" (1/1) ... [2024-11-09 07:46:27,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:46:27,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:46:27,218 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) [2024-11-09 07:46:27,222 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 [2024-11-09 07:46:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:46:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:46:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 07:46:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:46:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:46:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 07:46:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:46:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2024-11-09 07:46:27,273 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2024-11-09 07:46:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:46:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:46:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:46:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:46:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 07:46:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:46:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:46:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 07:46:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:46:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 07:46:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 07:46:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 07:46:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:46:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:46:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 07:46:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:46:27,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:46:27,452 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:46:27,454 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:46:28,006 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2024-11-09 07:46:28,006 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:46:28,031 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:46:28,031 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-09 07:46:28,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:46:28 BoogieIcfgContainer [2024-11-09 07:46:28,032 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:46:28,034 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:46:28,034 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:46:28,037 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:46:28,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:46:26" (1/3) ... [2024-11-09 07:46:28,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3589734d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:46:28, skipping insertion in model container [2024-11-09 07:46:28,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:27" (2/3) ... [2024-11-09 07:46:28,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3589734d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:46:28, skipping insertion in model container [2024-11-09 07:46:28,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:46:28" (3/3) ... [2024-11-09 07:46:28,040 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2024-11-09 07:46:28,055 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:46:28,056 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2024-11-09 07:46:28,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:46:28,117 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5a554b7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:46:28,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2024-11-09 07:46:28,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 195 states, 99 states have (on average 2.090909090909091) internal successors, (207), 191 states have internal predecessors, (207), 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) [2024-11-09 07:46:28,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 07:46:28,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:28,129 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 07:46:28,130 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-09 07:46:28,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:28,137 INFO L85 PathProgramCache]: Analyzing trace with hash 4960777, now seen corresponding path program 1 times [2024-11-09 07:46:28,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:28,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128067256] [2024-11-09 07:46:28,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:28,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:28,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:28,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:28,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128067256] [2024-11-09 07:46:28,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128067256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:46:28,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:46:28,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:46:28,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570623286] [2024-11-09 07:46:28,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:46:28,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 07:46:28,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:28,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 07:46:28,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:46:28,348 INFO L87 Difference]: Start difference. First operand has 195 states, 99 states have (on average 2.090909090909091) internal successors, (207), 191 states have internal predecessors, (207), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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) [2024-11-09 07:46:28,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:28,384 INFO L93 Difference]: Finished difference Result 195 states and 207 transitions. [2024-11-09 07:46:28,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 07:46:28,386 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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 [2024-11-09 07:46:28,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:28,397 INFO L225 Difference]: With dead ends: 195 [2024-11-09 07:46:28,397 INFO L226 Difference]: Without dead ends: 193 [2024-11-09 07:46:28,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:46:28,403 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:28,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:46:28,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-09 07:46:28,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-11-09 07:46:28,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 98 states have (on average 2.0510204081632653) internal successors, (201), 189 states have internal predecessors, (201), 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) [2024-11-09 07:46:28,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 205 transitions. [2024-11-09 07:46:28,453 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 205 transitions. Word has length 4 [2024-11-09 07:46:28,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:28,453 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 205 transitions. [2024-11-09 07:46:28,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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) [2024-11-09 07:46:28,454 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 205 transitions. [2024-11-09 07:46:28,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 07:46:28,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:28,454 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 07:46:28,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:46:28,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-09 07:46:28,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:28,456 INFO L85 PathProgramCache]: Analyzing trace with hash 4958341, now seen corresponding path program 1 times [2024-11-09 07:46:28,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:28,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503214671] [2024-11-09 07:46:28,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:28,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:28,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:28,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:28,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503214671] [2024-11-09 07:46:28,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503214671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:46:28,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:46:28,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:46:28,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941397312] [2024-11-09 07:46:28,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:46:28,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:46:28,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:28,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:46:28,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:46:28,670 INFO L87 Difference]: Start difference. First operand 193 states and 205 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) [2024-11-09 07:46:28,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:28,978 INFO L93 Difference]: Finished difference Result 187 states and 199 transitions. [2024-11-09 07:46:28,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:46:28,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 07:46:28,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:28,980 INFO L225 Difference]: With dead ends: 187 [2024-11-09 07:46:28,981 INFO L226 Difference]: Without dead ends: 187 [2024-11-09 07:46:28,981 INFO L431 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 [2024-11-09 07:46:28,982 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 77 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:28,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 317 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:46:28,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-09 07:46:28,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-11-09 07:46:28,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 98 states have (on average 1.989795918367347) 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) [2024-11-09 07:46:29,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2024-11-09 07:46:29,003 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 4 [2024-11-09 07:46:29,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:29,004 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2024-11-09 07:46:29,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:29,004 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2024-11-09 07:46:29,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 07:46:29,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:29,004 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 07:46:29,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:46:29,005 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-09 07:46:29,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:29,006 INFO L85 PathProgramCache]: Analyzing trace with hash 4958342, now seen corresponding path program 1 times [2024-11-09 07:46:29,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:29,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912207942] [2024-11-09 07:46:29,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:29,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:29,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:29,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:29,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912207942] [2024-11-09 07:46:29,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912207942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:46:29,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:46:29,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:46:29,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867901549] [2024-11-09 07:46:29,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:46:29,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:46:29,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:29,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:46:29,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:46:29,188 INFO L87 Difference]: Start difference. First operand 187 states and 199 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) [2024-11-09 07:46:29,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:29,488 INFO L93 Difference]: Finished difference Result 203 states and 218 transitions. [2024-11-09 07:46:29,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:46:29,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 07:46:29,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:29,493 INFO L225 Difference]: With dead ends: 203 [2024-11-09 07:46:29,493 INFO L226 Difference]: Without dead ends: 203 [2024-11-09 07:46:29,493 INFO L431 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 [2024-11-09 07:46:29,494 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 28 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:29,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 361 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:46:29,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-09 07:46:29,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 192. [2024-11-09 07:46:29,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 103 states have (on average 1.9611650485436893) internal successors, (202), 188 states have internal predecessors, (202), 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) [2024-11-09 07:46:29,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 206 transitions. [2024-11-09 07:46:29,519 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 206 transitions. Word has length 4 [2024-11-09 07:46:29,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:29,519 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 206 transitions. [2024-11-09 07:46:29,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:29,520 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 206 transitions. [2024-11-09 07:46:29,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:46:29,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:29,520 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:46:29,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:46:29,520 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-09 07:46:29,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:29,521 INFO L85 PathProgramCache]: Analyzing trace with hash 153708682, now seen corresponding path program 1 times [2024-11-09 07:46:29,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:29,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730470261] [2024-11-09 07:46:29,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:29,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:29,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:29,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:29,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730470261] [2024-11-09 07:46:29,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730470261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:46:29,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:46:29,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:46:29,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300872719] [2024-11-09 07:46:29,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:46:29,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:46:29,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:29,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:46:29,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:46:29,578 INFO L87 Difference]: Start difference. First operand 192 states and 206 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) [2024-11-09 07:46:29,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:29,703 INFO L93 Difference]: Finished difference Result 190 states and 203 transitions. [2024-11-09 07:46:29,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:46:29,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 07:46:29,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:29,705 INFO L225 Difference]: With dead ends: 190 [2024-11-09 07:46:29,705 INFO L226 Difference]: Without dead ends: 190 [2024-11-09 07:46:29,705 INFO L431 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 [2024-11-09 07:46:29,707 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 15 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 279 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 [2024-11-09 07:46:29,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 279 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:46:29,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-09 07:46:29,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-11-09 07:46:29,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 103 states have (on average 1.9320388349514563) internal successors, (199), 186 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:46:29,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 203 transitions. [2024-11-09 07:46:29,723 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 203 transitions. Word has length 5 [2024-11-09 07:46:29,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:29,726 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 203 transitions. [2024-11-09 07:46:29,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:29,726 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 203 transitions. [2024-11-09 07:46:29,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:46:29,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:29,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:46:29,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:46:29,727 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-09 07:46:29,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:29,728 INFO L85 PathProgramCache]: Analyzing trace with hash 153708683, now seen corresponding path program 1 times [2024-11-09 07:46:29,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:29,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800976604] [2024-11-09 07:46:29,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:29,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:29,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:29,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:29,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800976604] [2024-11-09 07:46:29,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800976604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:46:29,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:46:29,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:46:29,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779431843] [2024-11-09 07:46:29,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:46:29,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:46:29,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:29,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:46:29,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:46:29,816 INFO L87 Difference]: Start difference. First operand 190 states and 203 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) [2024-11-09 07:46:29,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:29,935 INFO L93 Difference]: Finished difference Result 188 states and 200 transitions. [2024-11-09 07:46:29,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:46:29,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 07:46:29,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:29,936 INFO L225 Difference]: With dead ends: 188 [2024-11-09 07:46:29,936 INFO L226 Difference]: Without dead ends: 188 [2024-11-09 07:46:29,936 INFO L431 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 [2024-11-09 07:46:29,937 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:29,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 286 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:46:29,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-09 07:46:29,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-11-09 07:46:29,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 103 states have (on average 1.9029126213592233) internal successors, (196), 184 states have internal predecessors, (196), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:46:29,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 200 transitions. [2024-11-09 07:46:29,944 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 200 transitions. Word has length 5 [2024-11-09 07:46:29,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:29,944 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 200 transitions. [2024-11-09 07:46:29,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:29,944 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 200 transitions. [2024-11-09 07:46:29,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:46:29,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:29,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:29,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:46:29,945 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-09 07:46:29,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:29,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1301215081, now seen corresponding path program 1 times [2024-11-09 07:46:29,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:29,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973409377] [2024-11-09 07:46:29,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:29,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:30,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:30,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:30,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973409377] [2024-11-09 07:46:30,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973409377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:46:30,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:46:30,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:46:30,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796540196] [2024-11-09 07:46:30,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:46:30,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:46:30,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:30,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:46:30,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:46:30,089 INFO L87 Difference]: Start difference. First operand 188 states and 200 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) [2024-11-09 07:46:30,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:30,187 INFO L93 Difference]: Finished difference Result 197 states and 210 transitions. [2024-11-09 07:46:30,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:46:30,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 07:46:30,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:30,188 INFO L225 Difference]: With dead ends: 197 [2024-11-09 07:46:30,188 INFO L226 Difference]: Without dead ends: 197 [2024-11-09 07:46:30,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:46:30,190 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 18 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 722 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:30,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 722 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:46:30,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-09 07:46:30,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 189. [2024-11-09 07:46:30,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 104 states have (on average 1.8942307692307692) internal successors, (197), 185 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) [2024-11-09 07:46:30,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 201 transitions. [2024-11-09 07:46:30,198 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 201 transitions. Word has length 10 [2024-11-09 07:46:30,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:30,198 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 201 transitions. [2024-11-09 07:46:30,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:30,199 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 201 transitions. [2024-11-09 07:46:30,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:46:30,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:30,199 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:30,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:46:30,199 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-09 07:46:30,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:30,200 INFO L85 PathProgramCache]: Analyzing trace with hash -635255016, now seen corresponding path program 1 times [2024-11-09 07:46:30,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:30,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293385408] [2024-11-09 07:46:30,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:30,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:30,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:30,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:30,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293385408] [2024-11-09 07:46:30,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293385408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:46:30,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:46:30,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:46:30,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829139481] [2024-11-09 07:46:30,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:46:30,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:46:30,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:30,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:46:30,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:46:30,288 INFO L87 Difference]: Start difference. First operand 189 states and 201 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) [2024-11-09 07:46:30,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:30,318 INFO L93 Difference]: Finished difference Result 269 states and 285 transitions. [2024-11-09 07:46:30,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:46:30,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 07:46:30,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:30,319 INFO L225 Difference]: With dead ends: 269 [2024-11-09 07:46:30,319 INFO L226 Difference]: Without dead ends: 269 [2024-11-09 07:46:30,320 INFO L431 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 [2024-11-09 07:46:30,320 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 84 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 569 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 [2024-11-09 07:46:30,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 569 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:46:30,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-09 07:46:30,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 233. [2024-11-09 07:46:30,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 147 states have (on average 1.91156462585034) internal successors, (281), 228 states have internal predecessors, (281), 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) [2024-11-09 07:46:30,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 285 transitions. [2024-11-09 07:46:30,329 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 285 transitions. Word has length 12 [2024-11-09 07:46:30,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:30,329 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 285 transitions. [2024-11-09 07:46:30,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:30,330 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 285 transitions. [2024-11-09 07:46:30,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:46:30,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:30,331 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:30,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:46:30,332 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-09 07:46:30,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:30,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1781937173, now seen corresponding path program 1 times [2024-11-09 07:46:30,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:30,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831597919] [2024-11-09 07:46:30,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:30,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:30,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:30,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:30,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831597919] [2024-11-09 07:46:30,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831597919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:46:30,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:46:30,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:46:30,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215944728] [2024-11-09 07:46:30,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:46:30,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:46:30,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:30,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:46:30,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:46:30,402 INFO L87 Difference]: Start difference. First operand 233 states and 285 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) [2024-11-09 07:46:30,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:30,545 INFO L93 Difference]: Finished difference Result 218 states and 255 transitions. [2024-11-09 07:46:30,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:46:30,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 07:46:30,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:30,547 INFO L225 Difference]: With dead ends: 218 [2024-11-09 07:46:30,547 INFO L226 Difference]: Without dead ends: 218 [2024-11-09 07:46:30,547 INFO L431 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 [2024-11-09 07:46:30,548 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 47 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 208 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 [2024-11-09 07:46:30,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 208 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:46:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-09 07:46:30,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-11-09 07:46:30,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 147 states have (on average 1.7074829931972788) internal successors, (251), 213 states have internal predecessors, (251), 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) [2024-11-09 07:46:30,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 255 transitions. [2024-11-09 07:46:30,555 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 255 transitions. Word has length 13 [2024-11-09 07:46:30,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:30,556 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 255 transitions. [2024-11-09 07:46:30,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:30,556 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 255 transitions. [2024-11-09 07:46:30,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:46:30,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:30,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:30,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:46:30,558 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-09 07:46:30,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:30,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1781937174, now seen corresponding path program 1 times [2024-11-09 07:46:30,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:30,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399936791] [2024-11-09 07:46:30,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:30,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:30,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:30,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:30,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399936791] [2024-11-09 07:46:30,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399936791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:46:30,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:46:30,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:46:30,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35086995] [2024-11-09 07:46:30,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:46:30,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:46:30,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:30,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:46:30,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:46:30,708 INFO L87 Difference]: Start difference. First operand 218 states and 255 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) [2024-11-09 07:46:30,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:30,822 INFO L93 Difference]: Finished difference Result 203 states and 225 transitions. [2024-11-09 07:46:30,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:46:30,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 07:46:30,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:30,824 INFO L225 Difference]: With dead ends: 203 [2024-11-09 07:46:30,824 INFO L226 Difference]: Without dead ends: 203 [2024-11-09 07:46:30,824 INFO L431 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 [2024-11-09 07:46:30,825 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 47 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:30,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 210 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:46:30,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-09 07:46:30,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-11-09 07:46:30,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 147 states have (on average 1.5034013605442176) internal successors, (221), 198 states have internal predecessors, (221), 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) [2024-11-09 07:46:30,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 225 transitions. [2024-11-09 07:46:30,833 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 225 transitions. Word has length 13 [2024-11-09 07:46:30,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:30,833 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 225 transitions. [2024-11-09 07:46:30,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:30,834 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 225 transitions. [2024-11-09 07:46:30,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:46:30,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:30,835 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:30,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:46:30,835 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-09 07:46:30,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:30,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1726961989, now seen corresponding path program 1 times [2024-11-09 07:46:30,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:30,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097580132] [2024-11-09 07:46:30,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:30,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:30,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:30,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097580132] [2024-11-09 07:46:30,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097580132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:46:30,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:46:30,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:46:30,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751677117] [2024-11-09 07:46:30,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:46:30,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:46:30,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:30,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:46:30,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:46:30,975 INFO L87 Difference]: Start difference. First operand 203 states and 225 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) [2024-11-09 07:46:31,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:31,163 INFO L93 Difference]: Finished difference Result 256 states and 291 transitions. [2024-11-09 07:46:31,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:46:31,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 07:46:31,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:31,165 INFO L225 Difference]: With dead ends: 256 [2024-11-09 07:46:31,165 INFO L226 Difference]: Without dead ends: 256 [2024-11-09 07:46:31,165 INFO L431 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 [2024-11-09 07:46:31,165 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 24 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:31,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 421 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:46:31,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-09 07:46:31,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 211. [2024-11-09 07:46:31,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 155 states have (on average 1.5032258064516129) internal successors, (233), 206 states have internal predecessors, (233), 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) [2024-11-09 07:46:31,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 237 transitions. [2024-11-09 07:46:31,170 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 237 transitions. Word has length 18 [2024-11-09 07:46:31,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:31,171 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 237 transitions. [2024-11-09 07:46:31,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:31,171 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 237 transitions. [2024-11-09 07:46:31,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:46:31,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:31,173 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:31,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:46:31,173 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-09 07:46:31,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:31,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1726961990, now seen corresponding path program 1 times [2024-11-09 07:46:31,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:31,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332951399] [2024-11-09 07:46:31,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:31,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:31,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:31,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:31,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332951399] [2024-11-09 07:46:31,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332951399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:46:31,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:46:31,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:46:31,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276881470] [2024-11-09 07:46:31,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:46:31,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:46:31,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:31,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:46:31,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:46:31,407 INFO L87 Difference]: Start difference. First operand 211 states and 237 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) [2024-11-09 07:46:31,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:31,603 INFO L93 Difference]: Finished difference Result 211 states and 233 transitions. [2024-11-09 07:46:31,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:46:31,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 07:46:31,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:31,605 INFO L225 Difference]: With dead ends: 211 [2024-11-09 07:46:31,605 INFO L226 Difference]: Without dead ends: 211 [2024-11-09 07:46:31,605 INFO L431 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 [2024-11-09 07:46:31,606 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 4 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:31,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 436 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:46:31,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-09 07:46:31,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-11-09 07:46:31,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 155 states have (on average 1.4774193548387098) internal successors, (229), 206 states have internal predecessors, (229), 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) [2024-11-09 07:46:31,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 233 transitions. [2024-11-09 07:46:31,611 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 233 transitions. Word has length 18 [2024-11-09 07:46:31,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:31,611 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 233 transitions. [2024-11-09 07:46:31,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:31,611 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 233 transitions. [2024-11-09 07:46:31,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:46:31,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:31,613 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:31,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:46:31,613 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-09 07:46:31,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:31,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1836431927, now seen corresponding path program 1 times [2024-11-09 07:46:31,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:31,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451487183] [2024-11-09 07:46:31,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:31,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:31,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:31,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:31,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451487183] [2024-11-09 07:46:31,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451487183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:46:31,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899747862] [2024-11-09 07:46:31,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:31,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:46:31,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:46:31,826 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) [2024-11-09 07:46:31,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:46:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:31,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 07:46:31,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:46:31,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 07:46:32,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 07:46:32,077 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:46:32,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 07:46:32,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 07:46:32,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:32,138 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:46:32,164 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-09 07:46:32,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 07:46:32,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:32,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899747862] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:46:32,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:46:32,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-09 07:46:32,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383536938] [2024-11-09 07:46:32,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:46:32,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:46:32,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:32,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:46:32,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=81, Unknown=4, NotChecked=0, Total=110 [2024-11-09 07:46:32,237 INFO L87 Difference]: Start difference. First operand 211 states and 233 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 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) [2024-11-09 07:46:32,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:32,508 INFO L93 Difference]: Finished difference Result 212 states and 233 transitions. [2024-11-09 07:46:32,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:46:32,509 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 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 24 [2024-11-09 07:46:32,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:32,510 INFO L225 Difference]: With dead ends: 212 [2024-11-09 07:46:32,510 INFO L226 Difference]: Without dead ends: 212 [2024-11-09 07:46:32,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=94, Unknown=4, NotChecked=0, Total=132 [2024-11-09 07:46:32,510 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 69 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:32,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 922 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:46:32,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-09 07:46:32,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2024-11-09 07:46:32,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 155 states have (on average 1.4645161290322581) internal successors, (227), 205 states have internal predecessors, (227), 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) [2024-11-09 07:46:32,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2024-11-09 07:46:32,515 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 24 [2024-11-09 07:46:32,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:32,516 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2024-11-09 07:46:32,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 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) [2024-11-09 07:46:32,516 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2024-11-09 07:46:32,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:46:32,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:32,517 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:32,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:46:32,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 07:46:32,722 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-09 07:46:32,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:32,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1836431926, now seen corresponding path program 1 times [2024-11-09 07:46:32,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:32,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670489367] [2024-11-09 07:46:32,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:32,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:33,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:33,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:33,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670489367] [2024-11-09 07:46:33,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670489367] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:46:33,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703104838] [2024-11-09 07:46:33,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:33,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:46:33,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:46:33,115 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) [2024-11-09 07:46:33,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:46:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:33,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 07:46:33,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:46:33,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:46:33,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-09 07:46:33,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 07:46:33,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:46:33,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 07:46:33,409 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:46:33,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 07:46:33,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 07:46:33,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 07:46:33,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 07:46:33,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:33,517 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:46:33,712 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_222 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_222) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_222) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_221) c_create_data_~data~0.base) .cse2))))))) is different from false [2024-11-09 07:46:33,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:33,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2024-11-09 07:46:33,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2024-11-09 07:46:33,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:33,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-11-09 07:46:33,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:33,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-09 07:46:33,809 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:46:33,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-09 07:46:33,814 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:46:33,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-09 07:46:33,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 07:46:33,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703104838] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:46:33,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:46:33,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 21 [2024-11-09 07:46:33,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354510776] [2024-11-09 07:46:33,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:46:33,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 07:46:33,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:33,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 07:46:33,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=331, Unknown=14, NotChecked=38, Total=462 [2024-11-09 07:46:33,847 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 states have internal predecessors, (49), 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) [2024-11-09 07:46:34,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:34,576 INFO L93 Difference]: Finished difference Result 234 states and 257 transitions. [2024-11-09 07:46:34,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:46:34,576 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 states have internal predecessors, (49), 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 24 [2024-11-09 07:46:34,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:34,578 INFO L225 Difference]: With dead ends: 234 [2024-11-09 07:46:34,578 INFO L226 Difference]: Without dead ends: 234 [2024-11-09 07:46:34,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=466, Unknown=16, NotChecked=46, Total=650 [2024-11-09 07:46:34,579 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 20 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 4 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:34,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1056 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 701 Invalid, 19 Unknown, 90 Unchecked, 0.6s Time] [2024-11-09 07:46:34,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-09 07:46:34,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2024-11-09 07:46:34,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 179 states have (on average 1.4134078212290502) internal successors, (253), 229 states have internal predecessors, (253), 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) [2024-11-09 07:46:34,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 257 transitions. [2024-11-09 07:46:34,586 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 257 transitions. Word has length 24 [2024-11-09 07:46:34,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:34,587 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 257 transitions. [2024-11-09 07:46:34,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 states have internal predecessors, (49), 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) [2024-11-09 07:46:34,587 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 257 transitions. [2024-11-09 07:46:34,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:46:34,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:34,588 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:34,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:46:34,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 07:46:34,793 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-09 07:46:34,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:34,793 INFO L85 PathProgramCache]: Analyzing trace with hash 35849682, now seen corresponding path program 2 times [2024-11-09 07:46:34,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:34,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185430042] [2024-11-09 07:46:34,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:34,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:35,423 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:35,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:35,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185430042] [2024-11-09 07:46:35,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185430042] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:46:35,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145259049] [2024-11-09 07:46:35,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:46:35,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:46:35,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:46:35,426 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) [2024-11-09 07:46:35,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:46:35,571 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:46:35,571 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:46:35,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 07:46:35,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:46:35,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 07:46:35,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-09 07:46:35,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:46:35,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 07:46:35,775 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:46:35,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 07:46:35,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 07:46:35,916 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:46:35,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 07:46:35,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 07:46:36,046 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:46:36,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 07:46:36,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 07:46:36,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 07:46:36,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 07:46:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:36,152 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:46:36,254 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_create_data_~counter~0 4)) (.cse0 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_310 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_310) c_create_data_~data~0.base) .cse0) .cse1 4))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_310) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_309) c_create_data_~data~0.base) .cse0)))))) is different from false [2024-11-09 07:46:36,330 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_310) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_309) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_310 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_310) c_create_data_~data~0.base) .cse1) .cse2 8)))))) is different from false [2024-11-09 07:46:36,352 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse2 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_307))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (<= (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_308) .cse1 v_ArrVal_310) c_create_data_~data~0.base) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_309) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_308) (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_307) c_create_data_~data~0.base) .cse2) v_ArrVal_310) c_create_data_~data~0.base) .cse2) 8))))) is different from false [2024-11-09 07:46:36,468 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_307))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (<= (+ 16 .cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_308) .cse2 v_ArrVal_310) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_309) c_create_data_~data~0.base) .cse3)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_308) (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_307) c_create_data_~data~0.base) .cse3) v_ArrVal_310) c_create_data_~data~0.base) .cse3) 12)))))) is different from false [2024-11-09 07:46:36,496 WARN L851 $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_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_306))) (let ((.cse0 (select (select .cse1 c_create_data_~data~0.base) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_305) .cse0 v_ArrVal_308) (select (select (store .cse1 .cse0 v_ArrVal_307) c_create_data_~data~0.base) .cse2) v_ArrVal_310))) c_create_data_~data~0.base) .cse2) .cse3 12))) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_306))) (let ((.cse4 (select (select .cse7 c_create_data_~data~0.base) .cse2))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_307))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_305) .cse4 v_ArrVal_308) .cse5 v_ArrVal_310) c_create_data_~data~0.base) .cse2) 16 .cse3) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_309) c_create_data_~data~0.base) .cse2)))))))))) is different from false [2024-11-09 07:46:36,547 WARN L851 $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$#2.base| c_create_data_~data~0.base) .cse4))) (and (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_306))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_305) .cse2 v_ArrVal_308) (select (select (store .cse3 .cse2 v_ArrVal_307) c_create_data_~data~0.base) .cse4) v_ArrVal_310))) c_create_data_~data~0.base) .cse4) 12))) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_306))) (let ((.cse5 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_307))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (<= (+ 16 .cse0 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_305) .cse5 v_ArrVal_308) .cse6 v_ArrVal_310) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_309) c_create_data_~data~0.base) .cse4))))))))))) is different from false [2024-11-09 07:46:36,574 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_306))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_307))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (<= (+ 16 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_305) .cse1 v_ArrVal_308) .cse2 v_ArrVal_310) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_309) c_create_data_~data~0.base) .cse3)))))))) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_306))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_305) .cse6 v_ArrVal_308) (select (select (store .cse7 .cse6 v_ArrVal_307) c_create_data_~data~0.base) .cse3) v_ArrVal_310))) c_create_data_~data~0.base) .cse3) 12)))))) is different from false [2024-11-09 07:46:36,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:36,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 178 [2024-11-09 07:46:36,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:36,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 108 [2024-11-09 07:46:36,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6476 treesize of output 5654 [2024-11-09 07:46:36,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1304 treesize of output 1256 [2024-11-09 07:46:36,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2024-11-09 07:46:36,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2024-11-09 07:46:36,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2024-11-09 07:46:36,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2024-11-09 07:46:36,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 45 [2024-11-09 07:46:36,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-11-09 07:46:36,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:36,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 91 [2024-11-09 07:46:36,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:36,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 61 [2024-11-09 07:46:36,733 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:46:36,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 55 [2024-11-09 07:46:36,738 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:46:36,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 07:46:36,775 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 24 not checked. [2024-11-09 07:46:36,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145259049] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:46:36,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:46:36,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 35 [2024-11-09 07:46:36,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598970916] [2024-11-09 07:46:36,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:46:36,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 07:46:36,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:36,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 07:46:36,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=665, Unknown=16, NotChecked=420, Total=1260 [2024-11-09 07:46:36,777 INFO L87 Difference]: Start difference. First operand 234 states and 257 transitions. Second operand has 36 states, 35 states have (on average 2.4285714285714284) internal successors, (85), 36 states have internal predecessors, (85), 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) [2024-11-09 07:46:37,418 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_310) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_309) c_create_data_~data~0.base) .cse1)))) (<= (+ .cse3 .cse2 8) (select |c_#length| .cse0)) (forall ((v_ArrVal_310 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_310) c_create_data_~data~0.base) .cse1) .cse2 8))) (<= 0 (+ .cse3 .cse2 4))))) is different from false [2024-11-09 07:46:37,422 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse1)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_310) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_309) c_create_data_~data~0.base) .cse1)))) (<= 0 (+ .cse3 .cse2)) (<= (+ .cse3 .cse2 4) (select |c_#length| .cse0)) (forall ((v_ArrVal_310 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_310) c_create_data_~data~0.base) .cse1) .cse2 4)))))) is different from false [2024-11-09 07:46:38,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:38,106 INFO L93 Difference]: Finished difference Result 270 states and 295 transitions. [2024-11-09 07:46:38,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 07:46:38,106 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.4285714285714284) internal successors, (85), 36 states have internal predecessors, (85), 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 36 [2024-11-09 07:46:38,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:38,107 INFO L225 Difference]: With dead ends: 270 [2024-11-09 07:46:38,107 INFO L226 Difference]: Without dead ends: 270 [2024-11-09 07:46:38,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=242, Invalid=1032, Unknown=22, NotChecked=684, Total=1980 [2024-11-09 07:46:38,109 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 22 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 4 mSolverCounterUnsat, 34 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1822 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 34 IncrementalHoareTripleChecker+Unknown, 878 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:38,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1822 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1008 Invalid, 34 Unknown, 878 Unchecked, 0.9s Time] [2024-11-09 07:46:38,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-09 07:46:38,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2024-11-09 07:46:38,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 215 states have (on average 1.3534883720930233) internal successors, (291), 265 states have internal predecessors, (291), 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) [2024-11-09 07:46:38,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 295 transitions. [2024-11-09 07:46:38,114 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 295 transitions. Word has length 36 [2024-11-09 07:46:38,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:38,114 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 295 transitions. [2024-11-09 07:46:38,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.4285714285714284) internal successors, (85), 36 states have internal predecessors, (85), 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) [2024-11-09 07:46:38,115 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 295 transitions. [2024-11-09 07:46:38,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 07:46:38,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:38,116 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:38,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 07:46:38,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:46:38,321 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-09 07:46:38,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:38,321 INFO L85 PathProgramCache]: Analyzing trace with hash -444716368, now seen corresponding path program 1 times [2024-11-09 07:46:38,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:38,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572373638] [2024-11-09 07:46:38,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:38,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:38,429 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:38,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:38,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572373638] [2024-11-09 07:46:38,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572373638] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:46:38,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351212246] [2024-11-09 07:46:38,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:38,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:46:38,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:46:38,431 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) [2024-11-09 07:46:38,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:46:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:38,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:46:38,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:46:38,604 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:38,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:46:38,680 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:38,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351212246] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:46:38,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:46:38,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-09 07:46:38,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024136204] [2024-11-09 07:46:38,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:46:38,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:46:38,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:38,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:46:38,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:46:38,682 INFO L87 Difference]: Start difference. First operand 270 states and 295 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 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) [2024-11-09 07:46:38,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:38,733 INFO L93 Difference]: Finished difference Result 312 states and 339 transitions. [2024-11-09 07:46:38,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:46:38,733 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 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 49 [2024-11-09 07:46:38,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:38,737 INFO L225 Difference]: With dead ends: 312 [2024-11-09 07:46:38,737 INFO L226 Difference]: Without dead ends: 312 [2024-11-09 07:46:38,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:46:38,739 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 10 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:38,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 497 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:46:38,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-09 07:46:38,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2024-11-09 07:46:38,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 257 states have (on average 1.3035019455252919) internal successors, (335), 307 states have internal predecessors, (335), 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) [2024-11-09 07:46:38,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 339 transitions. [2024-11-09 07:46:38,746 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 339 transitions. Word has length 49 [2024-11-09 07:46:38,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:38,746 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 339 transitions. [2024-11-09 07:46:38,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 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) [2024-11-09 07:46:38,746 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 339 transitions. [2024-11-09 07:46:38,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 07:46:38,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:38,750 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:38,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 07:46:38,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 07:46:38,951 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-09 07:46:38,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:38,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1232152414, now seen corresponding path program 3 times [2024-11-09 07:46:38,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:38,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390083800] [2024-11-09 07:46:38,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:38,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:40,109 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:40,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:40,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390083800] [2024-11-09 07:46:40,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390083800] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:46:40,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736743047] [2024-11-09 07:46:40,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:46:40,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:46:40,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:46:40,111 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) [2024-11-09 07:46:40,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:46:40,400 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-09 07:46:40,400 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:46:40,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-09 07:46:40,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:46:40,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 07:46:40,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-09 07:46:40,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:46:40,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:46:40,617 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:46:40,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-09 07:46:40,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 07:46:40,749 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:46:40,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-09 07:46:40,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 07:46:40,887 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:46:40,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-09 07:46:40,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 07:46:41,032 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:46:41,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-09 07:46:41,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 07:46:41,247 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:46:41,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-09 07:46:41,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 07:46:41,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:46:41,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 43 [2024-11-09 07:46:41,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 07:46:41,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 07:46:41,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:46:41,546 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:41,547 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:46:41,770 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_543 Int) (v_ArrVal_545 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_545) c_create_data_~data~0.base) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 (store (select |c_#memory_$Pointer$#2.base| .cse1) (+ (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse2) .cse0) v_ArrVal_543)) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_545 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_545) c_create_data_~data~0.base) .cse2) 4)))))) is different from false [2024-11-09 07:46:41,790 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2)) (.cse0 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_545 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_545) c_create_data_~data~0.base) .cse2) 8))) (forall ((v_ArrVal_543 Int) (v_ArrVal_545 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_545) c_create_data_~data~0.base) .cse2) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 (store (select |c_#memory_$Pointer$#2.base| .cse1) (+ (select (select |c_#memory_$Pointer$#2.offset| c_create_data_~data~0.base) .cse2) .cse0 4) v_ArrVal_543)) c_create_data_~data~0.base) .cse2))))))) is different from false [2024-11-09 07:46:51,239 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_create_data_~counter~0 1)) (.cse2 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_create_data_~counter~0_40 Int)) (let ((.cse0 (* v_create_data_~counter~0_40 4)) (.cse7 (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_538))) (or (forall ((v_ArrVal_540 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_537))) (let ((.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (let ((.cse1 (store .cse7 .cse6 v_ArrVal_540))) (or (< (+ .cse0 (select (select .cse1 c_create_data_~data~0.base) .cse2) 4) 0) (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse4 (store .cse5 .cse6 v_ArrVal_539))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (store (store .cse1 .cse3 v_ArrVal_541) (select (select (store .cse4 .cse3 v_ArrVal_542) c_create_data_~data~0.base) .cse2) v_ArrVal_545))) c_create_data_~data~0.base) .cse2) 12)))))))) (< .cse8 v_create_data_~counter~0_40) (< (+ .cse0 (select (select .cse7 c_create_data_~data~0.base) .cse2)) 0)))) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_create_data_~counter~0_40 Int)) (let ((.cse9 (* v_create_data_~counter~0_40 4)) (.cse18 (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_538))) (or (forall ((v_ArrVal_540 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_537))) (let ((.cse17 (select (select .cse16 c_create_data_~data~0.base) .cse2))) (let ((.cse10 (store .cse18 .cse17 v_ArrVal_540))) (or (< (+ .cse9 (select (select .cse10 c_create_data_~data~0.base) .cse2) 4) 0) (forall ((v_ArrVal_543 Int) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (let ((.cse15 (store .cse16 .cse17 v_ArrVal_539))) (let ((.cse14 (select (select .cse15 c_create_data_~data~0.base) .cse2))) (let ((.cse13 (store .cse15 .cse14 v_ArrVal_542))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse2)) (.cse11 (store .cse10 .cse14 v_ArrVal_541))) (<= (+ .cse9 16 (select (select (store .cse11 .cse12 v_ArrVal_545) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store .cse13 .cse12 (store (select .cse13 .cse12) (+ .cse9 8 (select (select .cse11 c_create_data_~data~0.base) .cse2)) v_ArrVal_543)) c_create_data_~data~0.base) .cse2))))))))))))) (< .cse8 v_create_data_~counter~0_40) (< (+ .cse9 (select (select .cse18 c_create_data_~data~0.base) .cse2)) 0)))))) is different from false [2024-11-09 07:46:52,638 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (+ c_create_data_~counter~0 2)) (.cse12 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_543 Int) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_create_data_~counter~0_40 Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| .cse12 v_ArrVal_537))) (let ((.cse1 (store |c_#memory_$Pointer$#2.offset| .cse12 v_ArrVal_538)) (.cse11 (select (select .cse10 c_create_data_~data~0.base) .cse2))) (let ((.cse3 (* v_create_data_~counter~0_40 4)) (.cse4 (store .cse1 .cse11 v_ArrVal_540))) (or (< .cse0 v_create_data_~counter~0_40) (< (+ (select (select .cse1 c_create_data_~data~0.base) .cse2) .cse3) 0) (< (+ .cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2) 4) 0) (let ((.cse9 (store .cse10 .cse11 v_ArrVal_539))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse2))) (let ((.cse7 (store .cse9 .cse8 v_ArrVal_542))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse2)) (.cse5 (store .cse4 .cse8 v_ArrVal_541))) (< (+ (select (select (store .cse5 .cse6 v_ArrVal_545) c_create_data_~data~0.base) .cse2) .cse3 15) (select |c_#length| (select (select (store .cse7 .cse6 (store (select .cse7 .cse6) (+ .cse3 (select (select .cse5 c_create_data_~data~0.base) .cse2) 8) v_ArrVal_543)) c_create_data_~data~0.base) .cse2)))))))))))) (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_create_data_~counter~0_40 Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#2.base| .cse12 v_ArrVal_537))) (let ((.cse13 (store |c_#memory_$Pointer$#2.offset| .cse12 v_ArrVal_538)) (.cse19 (select (select .cse18 c_create_data_~data~0.base) .cse2))) (let ((.cse15 (store .cse13 .cse19 v_ArrVal_540)) (.cse14 (* v_create_data_~counter~0_40 4))) (or (< .cse0 v_create_data_~counter~0_40) (< (+ (select (select .cse13 c_create_data_~data~0.base) .cse2) .cse14) 0) (< (+ .cse14 (select (select .cse15 c_create_data_~data~0.base) .cse2) 4) 0) (< 0 (+ (select (select (let ((.cse17 (store .cse18 .cse19 v_ArrVal_539))) (let ((.cse16 (select (select .cse17 c_create_data_~data~0.base) .cse2))) (store (store .cse15 .cse16 v_ArrVal_541) (select (select (store .cse17 .cse16 v_ArrVal_542) c_create_data_~data~0.base) .cse2) v_ArrVal_545))) c_create_data_~data~0.base) .cse2) .cse14 13)))))))))) is different from false [2024-11-09 07:46:52,982 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_create_data_~counter~0 2)) (.cse3 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_create_data_~counter~0_40 Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_535))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse3))) (let ((.cse7 (store .cse10 .cse9 v_ArrVal_537))) (let ((.cse4 (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_536) .cse9 v_ArrVal_538)) (.cse8 (select (select .cse7 c_create_data_~data~0.base) .cse3))) (let ((.cse1 (* v_create_data_~counter~0_40 4)) (.cse2 (store .cse4 .cse8 v_ArrVal_540))) (or (< .cse0 v_create_data_~counter~0_40) (< (+ .cse1 (select (select .cse2 c_create_data_~data~0.base) .cse3) 4) 0) (< (+ .cse1 (select (select .cse4 c_create_data_~data~0.base) .cse3)) 0) (< 0 (+ .cse1 (select (select (let ((.cse6 (store .cse7 .cse8 v_ArrVal_539))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (store (store .cse2 .cse5 v_ArrVal_541) (select (select (store .cse6 .cse5 v_ArrVal_542) c_create_data_~data~0.base) .cse3) v_ArrVal_545))) c_create_data_~data~0.base) .cse3) 13))))))))) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_543 Int) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_create_data_~counter~0_40 Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_535))) (let ((.cse21 (select (select .cse22 c_create_data_~data~0.base) .cse3))) (let ((.cse19 (store .cse22 .cse21 v_ArrVal_537))) (let ((.cse13 (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_536) .cse21 v_ArrVal_538)) (.cse20 (select (select .cse19 c_create_data_~data~0.base) .cse3))) (let ((.cse11 (* v_create_data_~counter~0_40 4)) (.cse12 (store .cse13 .cse20 v_ArrVal_540))) (or (< .cse0 v_create_data_~counter~0_40) (< (+ .cse11 (select (select .cse12 c_create_data_~data~0.base) .cse3) 4) 0) (< (+ .cse11 (select (select .cse13 c_create_data_~data~0.base) .cse3)) 0) (let ((.cse18 (store .cse19 .cse20 v_ArrVal_539))) (let ((.cse17 (select (select .cse18 c_create_data_~data~0.base) .cse3))) (let ((.cse16 (store .cse18 .cse17 v_ArrVal_542))) (let ((.cse15 (select (select .cse16 c_create_data_~data~0.base) .cse3)) (.cse14 (store .cse12 .cse17 v_ArrVal_541))) (< (+ .cse11 (select (select (store .cse14 .cse15 v_ArrVal_545) c_create_data_~data~0.base) .cse3) 15) (select |c_#length| (select (select (store .cse16 .cse15 (store (select .cse16 .cse15) (+ .cse11 8 (select (select .cse14 c_create_data_~data~0.base) .cse3)) v_ArrVal_543)) c_create_data_~data~0.base) .cse3)))))))))))))))) is different from false [2024-11-09 07:46:53,314 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse8 (+ c_create_data_~counter~0 2)) (.cse9 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_create_data_~counter~0_40 Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_535))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse2))) (let ((.cse5 (store .cse11 .cse10 v_ArrVal_537))) (let ((.cse7 (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_536) .cse10 v_ArrVal_538)) (.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (let ((.cse1 (store .cse7 .cse6 v_ArrVal_540)) (.cse0 (* v_create_data_~counter~0_40 4))) (or (< (+ .cse0 (select (select .cse1 c_create_data_~data~0.base) .cse2) 4) 0) (< 0 (+ .cse0 13 (select (select (let ((.cse4 (store .cse5 .cse6 v_ArrVal_539))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (store (store .cse1 .cse3 v_ArrVal_541) (select (select (store .cse4 .cse3 v_ArrVal_542) c_create_data_~data~0.base) .cse2) v_ArrVal_545))) c_create_data_~data~0.base) .cse2))) (< (+ .cse0 (select (select .cse7 c_create_data_~data~0.base) .cse2)) 0) (< .cse8 v_create_data_~counter~0_40)))))))) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_543 Int) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_create_data_~counter~0_40 Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_535))) (let ((.cse22 (select (select .cse23 c_create_data_~data~0.base) .cse2))) (let ((.cse19 (store .cse23 .cse22 v_ArrVal_537))) (let ((.cse21 (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_536) .cse22 v_ArrVal_538)) (.cse20 (select (select .cse19 c_create_data_~data~0.base) .cse2))) (let ((.cse16 (store .cse21 .cse20 v_ArrVal_540)) (.cse12 (* v_create_data_~counter~0_40 4))) (or (let ((.cse18 (store .cse19 .cse20 v_ArrVal_539))) (let ((.cse17 (select (select .cse18 c_create_data_~data~0.base) .cse2))) (let ((.cse15 (store .cse18 .cse17 v_ArrVal_542))) (let ((.cse14 (select (select .cse15 c_create_data_~data~0.base) .cse2)) (.cse13 (store .cse16 .cse17 v_ArrVal_541))) (< (+ .cse12 15 (select (select (store .cse13 .cse14 v_ArrVal_545) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store .cse15 .cse14 (store (select .cse15 .cse14) (+ .cse12 (select (select .cse13 c_create_data_~data~0.base) .cse2) 8) v_ArrVal_543)) c_create_data_~data~0.base) .cse2))))))) (< (+ .cse12 (select (select .cse16 c_create_data_~data~0.base) .cse2) 4) 0) (< (+ .cse12 (select (select .cse21 c_create_data_~data~0.base) .cse2)) 0) (< .cse8 v_create_data_~counter~0_40))))))))))) is different from false [2024-11-09 07:46:53,584 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse8 (+ c_create_data_~counter~0 3)) (.cse9 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_create_data_~counter~0_40 Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_535))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse2))) (let ((.cse5 (store .cse11 .cse10 v_ArrVal_537))) (let ((.cse7 (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_536) .cse10 v_ArrVal_538)) (.cse6 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (let ((.cse1 (store .cse7 .cse6 v_ArrVal_540)) (.cse0 (* v_create_data_~counter~0_40 4))) (or (< (+ .cse0 (select (select .cse1 c_create_data_~data~0.base) .cse2) 4) 0) (< 0 (+ .cse0 13 (select (select (let ((.cse4 (store .cse5 .cse6 v_ArrVal_539))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (store (store .cse1 .cse3 v_ArrVal_541) (select (select (store .cse4 .cse3 v_ArrVal_542) c_create_data_~data~0.base) .cse2) v_ArrVal_545))) c_create_data_~data~0.base) .cse2))) (< (+ .cse0 (select (select .cse7 c_create_data_~data~0.base) .cse2)) 0) (< .cse8 v_create_data_~counter~0_40)))))))) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_543 Int) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_create_data_~counter~0_40 Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_535))) (let ((.cse22 (select (select .cse23 c_create_data_~data~0.base) .cse2))) (let ((.cse19 (store .cse23 .cse22 v_ArrVal_537))) (let ((.cse21 (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_536) .cse22 v_ArrVal_538)) (.cse20 (select (select .cse19 c_create_data_~data~0.base) .cse2))) (let ((.cse16 (store .cse21 .cse20 v_ArrVal_540)) (.cse12 (* v_create_data_~counter~0_40 4))) (or (let ((.cse18 (store .cse19 .cse20 v_ArrVal_539))) (let ((.cse17 (select (select .cse18 c_create_data_~data~0.base) .cse2))) (let ((.cse15 (store .cse18 .cse17 v_ArrVal_542))) (let ((.cse14 (select (select .cse15 c_create_data_~data~0.base) .cse2)) (.cse13 (store .cse16 .cse17 v_ArrVal_541))) (< (+ .cse12 15 (select (select (store .cse13 .cse14 v_ArrVal_545) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store .cse15 .cse14 (store (select .cse15 .cse14) (+ .cse12 (select (select .cse13 c_create_data_~data~0.base) .cse2) 8) v_ArrVal_543)) c_create_data_~data~0.base) .cse2))))))) (< (+ .cse12 (select (select .cse16 c_create_data_~data~0.base) .cse2) 4) 0) (< (+ .cse12 (select (select .cse21 c_create_data_~data~0.base) .cse2)) 0) (< .cse8 v_create_data_~counter~0_40))))))))))) is different from false [2024-11-09 07:46:53,870 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (+ c_create_data_~counter~0 3)) (.cse2 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_533 (Array Int Int)) (v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 (Array Int Int)) (v_ArrVal_543 Int) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_create_data_~counter~0_40 Int)) (let ((.cse15 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_533))) (let ((.cse12 (select (select .cse15 c_create_data_~data~0.base) .cse2))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_535))) (let ((.cse13 (select (select .cse14 c_create_data_~data~0.base) .cse2))) (let ((.cse9 (store .cse14 .cse13 v_ArrVal_537))) (let ((.cse1 (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_534) .cse12 v_ArrVal_536) .cse13 v_ArrVal_538)) (.cse10 (select (select .cse9 c_create_data_~data~0.base) .cse2))) (let ((.cse0 (* v_create_data_~counter~0_40 4)) (.cse6 (store .cse1 .cse10 v_ArrVal_540))) (or (< (+ .cse0 (select (select .cse1 c_create_data_~data~0.base) .cse2)) 0) (let ((.cse8 (store .cse9 .cse10 v_ArrVal_539))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse2))) (let ((.cse5 (store .cse8 .cse7 v_ArrVal_542))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse2)) (.cse3 (store .cse6 .cse7 v_ArrVal_541))) (< (+ (select (select (store .cse3 .cse4 v_ArrVal_545) c_create_data_~data~0.base) .cse2) .cse0 15) (select |c_#length| (select (select (store .cse5 .cse4 (store (select .cse5 .cse4) (+ .cse0 8 (select (select .cse3 c_create_data_~data~0.base) .cse2)) v_ArrVal_543)) c_create_data_~data~0.base) .cse2))))))) (< (+ .cse0 4 (select (select .cse6 c_create_data_~data~0.base) .cse2)) 0) (< .cse11 v_create_data_~counter~0_40)))))))))) (forall ((v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_533 (Array Int Int)) (v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_create_data_~counter~0_40 Int)) (let ((.cse26 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_533))) (let ((.cse23 (select (select .cse26 c_create_data_~data~0.base) .cse2))) (let ((.cse25 (store .cse26 .cse23 v_ArrVal_535))) (let ((.cse24 (select (select .cse25 c_create_data_~data~0.base) .cse2))) (let ((.cse21 (store .cse25 .cse24 v_ArrVal_537))) (let ((.cse17 (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_534) .cse23 v_ArrVal_536) .cse24 v_ArrVal_538)) (.cse22 (select (select .cse21 c_create_data_~data~0.base) .cse2))) (let ((.cse16 (* v_create_data_~counter~0_40 4)) (.cse18 (store .cse17 .cse22 v_ArrVal_540))) (or (< (+ .cse16 (select (select .cse17 c_create_data_~data~0.base) .cse2)) 0) (< 0 (+ (select (select (let ((.cse20 (store .cse21 .cse22 v_ArrVal_539))) (let ((.cse19 (select (select .cse20 c_create_data_~data~0.base) .cse2))) (store (store .cse18 .cse19 v_ArrVal_541) (select (select (store .cse20 .cse19 v_ArrVal_542) c_create_data_~data~0.base) .cse2) v_ArrVal_545))) c_create_data_~data~0.base) .cse2) .cse16 13)) (< (+ .cse16 4 (select (select .cse18 c_create_data_~data~0.base) .cse2)) 0) (< .cse11 v_create_data_~counter~0_40)))))))))))) is different from false [2024-11-09 07:46:58,281 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse3 (+ c_create_data_~counter~0 3)) (.cse9 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_533 (Array Int Int)) (v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_create_data_~counter~0_40 Int)) (let ((.cse13 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_533))) (let ((.cse10 (select (select .cse13 c_create_data_~data~0.base) .cse2))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_535))) (let ((.cse11 (select (select .cse12 c_create_data_~data~0.base) .cse2))) (let ((.cse7 (store .cse12 .cse11 v_ArrVal_537))) (let ((.cse1 (store (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_534) .cse10 v_ArrVal_536) .cse11 v_ArrVal_538)) (.cse8 (select (select .cse7 c_create_data_~data~0.base) .cse2))) (let ((.cse0 (* v_create_data_~counter~0_40 4)) (.cse4 (store .cse1 .cse8 v_ArrVal_540))) (or (< (+ .cse0 (select (select .cse1 c_create_data_~data~0.base) .cse2)) 0) (< .cse3 v_create_data_~counter~0_40) (< (+ .cse0 (select (select .cse4 c_create_data_~data~0.base) .cse2) 4) 0) (< 0 (+ .cse0 13 (select (select (let ((.cse6 (store .cse7 .cse8 v_ArrVal_539))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse2))) (store (store .cse4 .cse5 v_ArrVal_541) (select (select (store .cse6 .cse5 v_ArrVal_542) c_create_data_~data~0.base) .cse2) v_ArrVal_545))) c_create_data_~data~0.base) .cse2)))))))))))) (forall ((v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_533 (Array Int Int)) (v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 (Array Int Int)) (v_ArrVal_543 Int) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_create_data_~counter~0_40 Int)) (let ((.cse27 (store |c_#memory_$Pointer$#2.base| .cse9 v_ArrVal_533))) (let ((.cse24 (select (select .cse27 c_create_data_~data~0.base) .cse2))) (let ((.cse26 (store .cse27 .cse24 v_ArrVal_535))) (let ((.cse25 (select (select .cse26 c_create_data_~data~0.base) .cse2))) (let ((.cse22 (store .cse26 .cse25 v_ArrVal_537))) (let ((.cse15 (store (store (store |c_#memory_$Pointer$#2.offset| .cse9 v_ArrVal_534) .cse24 v_ArrVal_536) .cse25 v_ArrVal_538)) (.cse23 (select (select .cse22 c_create_data_~data~0.base) .cse2))) (let ((.cse14 (* v_create_data_~counter~0_40 4)) (.cse19 (store .cse15 .cse23 v_ArrVal_540))) (or (< (+ .cse14 (select (select .cse15 c_create_data_~data~0.base) .cse2)) 0) (let ((.cse21 (store .cse22 .cse23 v_ArrVal_539))) (let ((.cse20 (select (select .cse21 c_create_data_~data~0.base) .cse2))) (let ((.cse18 (store .cse21 .cse20 v_ArrVal_542))) (let ((.cse17 (select (select .cse18 c_create_data_~data~0.base) .cse2)) (.cse16 (store .cse19 .cse20 v_ArrVal_541))) (< (+ .cse14 15 (select (select (store .cse16 .cse17 v_ArrVal_545) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store .cse18 .cse17 (store (select .cse18 .cse17) (+ .cse14 (select (select .cse16 c_create_data_~data~0.base) .cse2) 8) v_ArrVal_543)) c_create_data_~data~0.base) .cse2))))))) (< .cse3 v_create_data_~counter~0_40) (< (+ .cse14 (select (select .cse19 c_create_data_~data~0.base) .cse2) 4) 0))))))))))))) is different from false [2024-11-09 07:46:58,745 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_533 (Array Int Int)) (v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 (Array Int Int)) (v_ArrVal_543 Int) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_create_data_~counter~0_40 Int)) (let ((.cse15 (store |c_#memory_$Pointer$#2.base| .cse11 v_ArrVal_533))) (let ((.cse12 (select (select .cse15 c_create_data_~data~0.base) .cse2))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_535))) (let ((.cse13 (select (select .cse14 c_create_data_~data~0.base) .cse2))) (let ((.cse9 (store .cse14 .cse13 v_ArrVal_537))) (let ((.cse1 (store (store (store |c_#memory_$Pointer$#2.offset| .cse11 v_ArrVal_534) .cse12 v_ArrVal_536) .cse13 v_ArrVal_538)) (.cse10 (select (select .cse9 c_create_data_~data~0.base) .cse2))) (let ((.cse0 (* v_create_data_~counter~0_40 4)) (.cse6 (store .cse1 .cse10 v_ArrVal_540))) (or (< (+ .cse0 (select (select .cse1 c_create_data_~data~0.base) .cse2)) 0) (let ((.cse8 (store .cse9 .cse10 v_ArrVal_539))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse2))) (let ((.cse5 (store .cse8 .cse7 v_ArrVal_542))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse2)) (.cse3 (store .cse6 .cse7 v_ArrVal_541))) (< (+ .cse0 15 (select (select (store .cse3 .cse4 v_ArrVal_545) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 (store (select .cse5 .cse4) (+ .cse0 (select (select .cse3 c_create_data_~data~0.base) .cse2) 8) v_ArrVal_543)) c_create_data_~data~0.base) .cse2))))))) (< 3 v_create_data_~counter~0_40) (< (+ .cse0 (select (select .cse6 c_create_data_~data~0.base) .cse2) 4) 0)))))))))) (forall ((v_ArrVal_540 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_533 (Array Int Int)) (v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_create_data_~counter~0_40 Int)) (let ((.cse26 (store |c_#memory_$Pointer$#2.base| .cse11 v_ArrVal_533))) (let ((.cse23 (select (select .cse26 c_create_data_~data~0.base) .cse2))) (let ((.cse25 (store .cse26 .cse23 v_ArrVal_535))) (let ((.cse24 (select (select .cse25 c_create_data_~data~0.base) .cse2))) (let ((.cse21 (store .cse25 .cse24 v_ArrVal_537))) (let ((.cse17 (store (store (store |c_#memory_$Pointer$#2.offset| .cse11 v_ArrVal_534) .cse23 v_ArrVal_536) .cse24 v_ArrVal_538)) (.cse22 (select (select .cse21 c_create_data_~data~0.base) .cse2))) (let ((.cse16 (* v_create_data_~counter~0_40 4)) (.cse18 (store .cse17 .cse22 v_ArrVal_540))) (or (< (+ .cse16 (select (select .cse17 c_create_data_~data~0.base) .cse2)) 0) (< 3 v_create_data_~counter~0_40) (< (+ .cse16 (select (select .cse18 c_create_data_~data~0.base) .cse2) 4) 0) (< 0 (+ .cse16 13 (select (select (let ((.cse20 (store .cse21 .cse22 v_ArrVal_539))) (let ((.cse19 (select (select .cse20 c_create_data_~data~0.base) .cse2))) (store (store .cse18 .cse19 v_ArrVal_541) (select (select (store .cse20 .cse19 v_ArrVal_542) c_create_data_~data~0.base) .cse2) v_ArrVal_545))) c_create_data_~data~0.base) .cse2))))))))))))))) is different from false [2024-11-09 07:46:58,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:58,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2737 treesize of output 2707 [2024-11-09 07:46:58,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:58,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2697 treesize of output 1507