./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU --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 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:11:14,858 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:11:14,964 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-31 22:11:14,974 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:11:14,975 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:11:15,018 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:11:15,019 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:11:15,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:11:15,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:11:15,022 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:11:15,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:11:15,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:11:15,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:11:15,023 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:11:15,024 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:11:15,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:11:15,028 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:11:15,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:11:15,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:11:15,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:11:15,029 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 22:11:15,030 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 22:11:15,030 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 22:11:15,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:11:15,031 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:11:15,031 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:11:15,031 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:11:15,031 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:11:15,032 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:11:15,032 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:11:15,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:11:15,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:11:15,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:11:15,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:11:15,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:11:15,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:11:15,048 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:11:15,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:11:15,049 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:11:15,049 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:11:15,050 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:11:15,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:11:15,052 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 [2024-10-31 22:11:15,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:11:15,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:11:15,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:11:15,453 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:11:15,454 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:11:15,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i Unable to find full path for "g++" [2024-10-31 22:11:17,757 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:11:18,137 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:11:18,141 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2024-10-31 22:11:18,164 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/data/ec2abdc35/75b4131b925147a59e36da654ef49675/FLAG54d1e8fe8 [2024-10-31 22:11:18,192 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/data/ec2abdc35/75b4131b925147a59e36da654ef49675 [2024-10-31 22:11:18,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:11:18,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:11:18,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:11:18,202 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:11:18,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:11:18,215 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:11:18" (1/1) ... [2024-10-31 22:11:18,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42c12dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:18, skipping insertion in model container [2024-10-31 22:11:18,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:11:18" (1/1) ... [2024-10-31 22:11:18,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:11:18,800 WARN L1053 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-10-31 22:11:18,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:11:18,854 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:11:18,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:11:18,974 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:11:18,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:18 WrapperNode [2024-10-31 22:11:18,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:11:18,977 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:11:18,978 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:11:18,978 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:11:18,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:18" (1/1) ... [2024-10-31 22:11:19,016 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:18" (1/1) ... [2024-10-31 22:11:19,060 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 120 [2024-10-31 22:11:19,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:11:19,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:11:19,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:11:19,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:11:19,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:18" (1/1) ... [2024-10-31 22:11:19,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:18" (1/1) ... [2024-10-31 22:11:19,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:18" (1/1) ... [2024-10-31 22:11:19,176 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 11, 8]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 8 writes are split as follows [0, 6, 2]. [2024-10-31 22:11:19,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:18" (1/1) ... [2024-10-31 22:11:19,181 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:18" (1/1) ... [2024-10-31 22:11:19,201 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:18" (1/1) ... [2024-10-31 22:11:19,213 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:18" (1/1) ... [2024-10-31 22:11:19,225 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:18" (1/1) ... [2024-10-31 22:11:19,227 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:18" (1/1) ... [2024-10-31 22:11:19,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:11:19,239 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:11:19,239 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:11:19,239 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:11:19,240 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:18" (1/1) ... [2024-10-31 22:11:19,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:11:19,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:11:19,298 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:11:19,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:11:19,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:11:19,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:11:19,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-31 22:11:19,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-31 22:11:19,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:11:19,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-31 22:11:19,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-31 22:11:19,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-31 22:11:19,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-31 22:11:19,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-31 22:11:19,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-31 22:11:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-31 22:11:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 22:11:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-31 22:11:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-31 22:11:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-31 22:11:19,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:11:19,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:11:19,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-31 22:11:19,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:11:19,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:11:19,512 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:11:19,514 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:11:20,158 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-10-31 22:11:20,158 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:11:20,188 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:11:20,189 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-31 22:11:20,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:11:20 BoogieIcfgContainer [2024-10-31 22:11:20,190 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:11:20,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:11:20,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:11:20,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:11:20,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:11:18" (1/3) ... [2024-10-31 22:11:20,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@560667f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:11:20, skipping insertion in model container [2024-10-31 22:11:20,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:18" (2/3) ... [2024-10-31 22:11:20,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@560667f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:11:20, skipping insertion in model container [2024-10-31 22:11:20,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:11:20" (3/3) ... [2024-10-31 22:11:20,201 INFO L112 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2024-10-31 22:11:20,226 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:11:20,227 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2024-10-31 22:11:20,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:11:20,300 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;@9d2ea5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:11:20,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-10-31 22:11:20,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 56 states have (on average 2.0) internal successors, (112), 102 states have internal predecessors, (112), 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-10-31 22:11:20,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-31 22:11:20,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:20,315 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-31 22:11:20,315 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:20,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:20,322 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2024-10-31 22:11:20,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:20,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949074748] [2024-10-31 22:11:20,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:20,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:20,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-10-31 22:11:20,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:20,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949074748] [2024-10-31 22:11:20,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949074748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:20,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:20,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:11:20,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195324459] [2024-10-31 22:11:20,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:20,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:11:20,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:20,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:11:20,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:11:20,862 INFO L87 Difference]: Start difference. First operand has 103 states, 56 states have (on average 2.0) internal successors, (112), 102 states have internal predecessors, (112), 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) 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-10-31 22:11:21,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:21,097 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2024-10-31 22:11:21,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:11:21,101 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-10-31 22:11:21,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:21,110 INFO L225 Difference]: With dead ends: 106 [2024-10-31 22:11:21,110 INFO L226 Difference]: Without dead ends: 104 [2024-10-31 22:11:21,113 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-10-31 22:11:21,118 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 120 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:21,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 97 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:11:21,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-31 22:11:21,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2024-10-31 22:11:21,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 97 states have internal predecessors, (105), 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-10-31 22:11:21,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2024-10-31 22:11:21,158 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 4 [2024-10-31 22:11:21,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:21,159 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2024-10-31 22:11:21,159 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-10-31 22:11:21,160 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2024-10-31 22:11:21,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-31 22:11:21,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:21,160 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-31 22:11:21,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:11:21,161 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:21,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:21,162 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2024-10-31 22:11:21,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:21,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803107490] [2024-10-31 22:11:21,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:21,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:21,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:21,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:21,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803107490] [2024-10-31 22:11:21,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803107490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:21,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:21,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:11:21,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040718551] [2024-10-31 22:11:21,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:21,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:11:21,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:21,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:11:21,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:11:21,441 INFO L87 Difference]: Start difference. First operand 98 states and 105 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-10-31 22:11:21,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:21,841 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2024-10-31 22:11:21,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:11:21,844 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-10-31 22:11:21,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:21,846 INFO L225 Difference]: With dead ends: 137 [2024-10-31 22:11:21,846 INFO L226 Difference]: Without dead ends: 137 [2024-10-31 22:11:21,846 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-10-31 22:11:21,853 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 117 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:21,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 101 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:11:21,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-31 22:11:21,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 107. [2024-10-31 22:11:21,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 68 states have (on average 1.7647058823529411) internal successors, (120), 106 states have internal predecessors, (120), 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-10-31 22:11:21,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2024-10-31 22:11:21,875 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 4 [2024-10-31 22:11:21,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:21,876 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2024-10-31 22:11:21,876 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-10-31 22:11:21,876 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2024-10-31 22:11:21,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-31 22:11:21,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:21,878 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-31 22:11:21,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:11:21,879 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:21,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:21,882 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2024-10-31 22:11:21,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:21,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185646490] [2024-10-31 22:11:21,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:21,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:21,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:21,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:21,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185646490] [2024-10-31 22:11:21,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185646490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:21,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:21,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:11:21,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137262351] [2024-10-31 22:11:21,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:21,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:11:21,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:21,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:11:21,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:11:21,955 INFO L87 Difference]: Start difference. First operand 107 states and 120 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-10-31 22:11:22,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:22,071 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2024-10-31 22:11:22,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:11:22,072 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-10-31 22:11:22,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:22,073 INFO L225 Difference]: With dead ends: 105 [2024-10-31 22:11:22,073 INFO L226 Difference]: Without dead ends: 105 [2024-10-31 22:11:22,074 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-10-31 22:11:22,075 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 31 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:22,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 114 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:11:22,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-31 22:11:22,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-31 22:11:22,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 68 states have (on average 1.7352941176470589) internal successors, (118), 104 states have internal predecessors, (118), 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-10-31 22:11:22,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2024-10-31 22:11:22,086 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 5 [2024-10-31 22:11:22,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:22,086 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2024-10-31 22:11:22,086 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-10-31 22:11:22,087 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2024-10-31 22:11:22,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-31 22:11:22,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:22,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-31 22:11:22,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:11:22,092 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:22,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:22,093 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2024-10-31 22:11:22,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:22,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970958408] [2024-10-31 22:11:22,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:22,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:22,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:22,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:22,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970958408] [2024-10-31 22:11:22,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970958408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:22,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:22,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:11:22,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928337267] [2024-10-31 22:11:22,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:22,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:11:22,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:22,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:11:22,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:11:22,204 INFO L87 Difference]: Start difference. First operand 105 states and 118 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-10-31 22:11:22,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:22,408 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2024-10-31 22:11:22,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:11:22,408 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-10-31 22:11:22,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:22,409 INFO L225 Difference]: With dead ends: 103 [2024-10-31 22:11:22,410 INFO L226 Difference]: Without dead ends: 103 [2024-10-31 22:11:22,410 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-10-31 22:11:22,415 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 31 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:22,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 119 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:11:22,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-31 22:11:22,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-31 22:11:22,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.7058823529411764) internal successors, (116), 102 states have internal predecessors, (116), 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-10-31 22:11:22,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2024-10-31 22:11:22,427 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 5 [2024-10-31 22:11:22,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:22,428 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2024-10-31 22:11:22,428 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-10-31 22:11:22,428 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2024-10-31 22:11:22,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-31 22:11:22,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:22,429 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:22,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:11:22,430 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:22,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:22,433 INFO L85 PathProgramCache]: Analyzing trace with hash 234240077, now seen corresponding path program 1 times [2024-10-31 22:11:22,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:22,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652473134] [2024-10-31 22:11:22,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:22,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:22,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:22,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:22,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652473134] [2024-10-31 22:11:22,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652473134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:22,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:22,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:11:22,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616721602] [2024-10-31 22:11:22,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:22,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:11:22,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:22,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:11:22,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:11:22,511 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:22,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:22,619 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2024-10-31 22:11:22,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:11:22,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-31 22:11:22,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:22,621 INFO L225 Difference]: With dead ends: 99 [2024-10-31 22:11:22,621 INFO L226 Difference]: Without dead ends: 99 [2024-10-31 22:11:22,621 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-10-31 22:11:22,623 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 15 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:22,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 117 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:11:22,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-31 22:11:22,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-31 22:11:22,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 68 states have (on average 1.6470588235294117) internal successors, (112), 98 states have internal predecessors, (112), 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-10-31 22:11:22,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2024-10-31 22:11:22,633 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 9 [2024-10-31 22:11:22,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:22,633 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2024-10-31 22:11:22,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:22,634 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2024-10-31 22:11:22,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-31 22:11:22,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:22,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:22,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:11:22,635 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:22,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:22,635 INFO L85 PathProgramCache]: Analyzing trace with hash 234240078, now seen corresponding path program 1 times [2024-10-31 22:11:22,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:22,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433416236] [2024-10-31 22:11:22,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:22,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:22,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:22,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:22,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433416236] [2024-10-31 22:11:22,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433416236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:22,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:22,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:11:22,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622505911] [2024-10-31 22:11:22,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:22,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:11:22,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:22,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:11:22,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:11:22,765 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:22,899 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2024-10-31 22:11:22,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:11:22,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-31 22:11:22,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:22,901 INFO L225 Difference]: With dead ends: 95 [2024-10-31 22:11:22,901 INFO L226 Difference]: Without dead ends: 95 [2024-10-31 22:11:22,901 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-10-31 22:11:22,902 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 15 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:22,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 122 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:11:22,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-31 22:11:22,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-31 22:11:22,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.588235294117647) internal successors, (108), 94 states have internal predecessors, (108), 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-10-31 22:11:22,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2024-10-31 22:11:22,917 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 9 [2024-10-31 22:11:22,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:22,922 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2024-10-31 22:11:22,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:11:22,922 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2024-10-31 22:11:22,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-31 22:11:22,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:22,923 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:22,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:11:22,923 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:22,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:22,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1431747280, now seen corresponding path program 1 times [2024-10-31 22:11:22,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:22,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139737075] [2024-10-31 22:11:22,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:22,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:23,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:23,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:23,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139737075] [2024-10-31 22:11:23,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139737075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:23,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:23,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:11:23,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579252027] [2024-10-31 22:11:23,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:23,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:11:23,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:23,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:11:23,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:11:23,122 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-10-31 22:11:23,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:23,274 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2024-10-31 22:11:23,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:11:23,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2024-10-31 22:11:23,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:23,275 INFO L225 Difference]: With dead ends: 104 [2024-10-31 22:11:23,276 INFO L226 Difference]: Without dead ends: 104 [2024-10-31 22:11:23,276 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-10-31 22:11:23,277 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 6 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:23,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 225 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:11:23,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-31 22:11:23,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2024-10-31 22:11:23,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.5833333333333333) internal successors, (114), 98 states have internal predecessors, (114), 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-10-31 22:11:23,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2024-10-31 22:11:23,287 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 14 [2024-10-31 22:11:23,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:23,287 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2024-10-31 22:11:23,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-10-31 22:11:23,287 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2024-10-31 22:11:23,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-31 22:11:23,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:23,288 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:23,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:11:23,289 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:23,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:23,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1431747281, now seen corresponding path program 1 times [2024-10-31 22:11:23,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:23,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000367205] [2024-10-31 22:11:23,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:23,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:23,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:23,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:23,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000367205] [2024-10-31 22:11:23,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000367205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:23,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:23,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:11:23,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819375371] [2024-10-31 22:11:23,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:23,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:11:23,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:23,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:11:23,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:11:23,569 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-10-31 22:11:23,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:23,737 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2024-10-31 22:11:23,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:11:23,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2024-10-31 22:11:23,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:23,739 INFO L225 Difference]: With dead ends: 99 [2024-10-31 22:11:23,739 INFO L226 Difference]: Without dead ends: 99 [2024-10-31 22:11:23,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:11:23,740 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 4 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:23,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 232 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:11:23,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-31 22:11:23,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-31 22:11:23,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.5555555555555556) internal successors, (112), 98 states have internal predecessors, (112), 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-10-31 22:11:23,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2024-10-31 22:11:23,753 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 14 [2024-10-31 22:11:23,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:23,754 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2024-10-31 22:11:23,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-10-31 22:11:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2024-10-31 22:11:23,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-31 22:11:23,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:23,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:23,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:11:23,756 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:23,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:23,756 INFO L85 PathProgramCache]: Analyzing trace with hash -475614716, now seen corresponding path program 1 times [2024-10-31 22:11:23,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:23,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645676963] [2024-10-31 22:11:23,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:23,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:23,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:23,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:23,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645676963] [2024-10-31 22:11:23,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645676963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:23,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:23,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:11:23,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398410132] [2024-10-31 22:11:23,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:23,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:11:23,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:23,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:11:23,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:11:23,942 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-10-31 22:11:24,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:24,073 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2024-10-31 22:11:24,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:11:24,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2024-10-31 22:11:24,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:24,075 INFO L225 Difference]: With dead ends: 160 [2024-10-31 22:11:24,075 INFO L226 Difference]: Without dead ends: 160 [2024-10-31 22:11:24,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-10-31 22:11:24,076 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 89 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:24,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 301 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:11:24,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-31 22:11:24,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 99. [2024-10-31 22:11:24,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 98 states have internal predecessors, (111), 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-10-31 22:11:24,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2024-10-31 22:11:24,081 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 18 [2024-10-31 22:11:24,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:24,081 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2024-10-31 22:11:24,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-10-31 22:11:24,082 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2024-10-31 22:11:24,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-31 22:11:24,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:24,083 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:24,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:11:24,083 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:24,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:24,084 INFO L85 PathProgramCache]: Analyzing trace with hash -475614743, now seen corresponding path program 1 times [2024-10-31 22:11:24,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:24,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519984269] [2024-10-31 22:11:24,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:24,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:24,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:24,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519984269] [2024-10-31 22:11:24,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519984269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:24,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:24,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:11:24,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742279602] [2024-10-31 22:11:24,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:24,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:11:24,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:24,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:11:24,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:11:24,332 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-10-31 22:11:24,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:24,561 INFO L93 Difference]: Finished difference Result 165 states and 186 transitions. [2024-10-31 22:11:24,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:11:24,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2024-10-31 22:11:24,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:24,563 INFO L225 Difference]: With dead ends: 165 [2024-10-31 22:11:24,563 INFO L226 Difference]: Without dead ends: 165 [2024-10-31 22:11:24,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:11:24,564 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 57 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:24,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 227 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:11:24,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-31 22:11:24,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 113. [2024-10-31 22:11:24,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.4767441860465116) internal successors, (127), 112 states have internal predecessors, (127), 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-10-31 22:11:24,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2024-10-31 22:11:24,569 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 18 [2024-10-31 22:11:24,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:24,569 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2024-10-31 22:11:24,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-10-31 22:11:24,570 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2024-10-31 22:11:24,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-31 22:11:24,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:24,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:24,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:11:24,571 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:24,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:24,572 INFO L85 PathProgramCache]: Analyzing trace with hash -475614744, now seen corresponding path program 1 times [2024-10-31 22:11:24,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:24,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682982899] [2024-10-31 22:11:24,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:24,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:24,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:24,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:24,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682982899] [2024-10-31 22:11:24,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682982899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:24,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:24,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:11:24,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695340300] [2024-10-31 22:11:24,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:24,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:11:24,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:24,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:11:24,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:11:24,743 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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-10-31 22:11:24,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:24,955 INFO L93 Difference]: Finished difference Result 177 states and 190 transitions. [2024-10-31 22:11:24,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:11:24,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2024-10-31 22:11:24,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:24,957 INFO L225 Difference]: With dead ends: 177 [2024-10-31 22:11:24,957 INFO L226 Difference]: Without dead ends: 177 [2024-10-31 22:11:24,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:11:24,958 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 98 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:24,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 208 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:11:24,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-31 22:11:24,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 113. [2024-10-31 22:11:24,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 112 states have internal predecessors, (125), 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-10-31 22:11:24,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2024-10-31 22:11:24,962 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 18 [2024-10-31 22:11:24,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:24,963 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2024-10-31 22:11:24,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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-10-31 22:11:24,963 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2024-10-31 22:11:24,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-31 22:11:24,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:24,965 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:24,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:11:24,966 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:24,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:24,968 INFO L85 PathProgramCache]: Analyzing trace with hash -764326860, now seen corresponding path program 1 times [2024-10-31 22:11:24,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:24,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25403125] [2024-10-31 22:11:24,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:24,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:25,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:25,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:25,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25403125] [2024-10-31 22:11:25,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25403125] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:11:25,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565827845] [2024-10-31 22:11:25,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:25,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:11:25,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:11:25,268 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:11:25,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:11:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:25,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-31 22:11:25,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:11:25,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-31 22:11:25,469 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-31 22:11:25,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-31 22:11:25,497 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-10-31 22:11:25,572 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-31 22:11:25,572 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-10-31 22:11:25,607 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-10-31 22:11:25,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:25,614 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:11:25,656 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-10-31 22:11:25,656 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-10-31 22:11:25,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:25,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565827845] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:11:25,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:11:25,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-10-31 22:11:25,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284606464] [2024-10-31 22:11:25,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:11:25,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-31 22:11:25,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:25,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-31 22:11:25,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=124, Unknown=2, NotChecked=0, Total=156 [2024-10-31 22:11:25,760 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 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-10-31 22:11:26,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:26,141 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2024-10-31 22:11:26,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:11:26,142 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 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 20 [2024-10-31 22:11:26,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:26,143 INFO L225 Difference]: With dead ends: 112 [2024-10-31 22:11:26,143 INFO L226 Difference]: Without dead ends: 112 [2024-10-31 22:11:26,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=183, Unknown=2, NotChecked=0, Total=240 [2024-10-31 22:11:26,144 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 21 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:26,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 576 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:11:26,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-31 22:11:26,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-31 22:11:26,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 86 states have (on average 1.441860465116279) internal successors, (124), 111 states have internal predecessors, (124), 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-10-31 22:11:26,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2024-10-31 22:11:26,148 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 20 [2024-10-31 22:11:26,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:26,150 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2024-10-31 22:11:26,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 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-10-31 22:11:26,150 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2024-10-31 22:11:26,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-31 22:11:26,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:26,151 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:26,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-31 22:11:26,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-31 22:11:26,352 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:26,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:26,353 INFO L85 PathProgramCache]: Analyzing trace with hash -764326859, now seen corresponding path program 1 times [2024-10-31 22:11:26,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:26,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471009141] [2024-10-31 22:11:26,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:26,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:26,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:26,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471009141] [2024-10-31 22:11:26,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471009141] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:11:26,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84501937] [2024-10-31 22:11:26,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:26,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:11:26,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:11:26,938 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:11:26,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-31 22:11:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:27,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-31 22:11:27,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:11:27,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-31 22:11:27,111 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-10-31 22:11:27,128 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-31 22:11:27,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-31 22:11:27,181 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-10-31 22:11:27,189 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-10-31 22:11:27,400 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-31 22:11:27,401 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-10-31 22:11:27,418 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-10-31 22:11:27,534 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-10-31 22:11:27,544 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-10-31 22:11:27,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:27,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:11:27,746 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4)) (.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))) (forall ((v_ArrVal_261 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 4))))) is different from false [2024-10-31 22:11:27,868 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_261 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_262) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))))))) is different from false [2024-10-31 22:11:27,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:11:27,881 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-10-31 22:11:27,887 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-10-31 22:11:27,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:11:27,906 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-10-31 22:11:27,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:11:27,916 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-10-31 22:11:27,920 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-31 22:11:27,923 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-10-31 22:11:27,928 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-31 22:11:27,930 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-10-31 22:11:28,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-31 22:11:28,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84501937] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:11:28,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:11:28,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 23 [2024-10-31 22:11:28,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039398074] [2024-10-31 22:11:28,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:11:28,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-31 22:11:28,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:28,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-31 22:11:28,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=383, Unknown=7, NotChecked=82, Total=552 [2024-10-31 22:11:28,011 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 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-10-31 22:11:29,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:29,031 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2024-10-31 22:11:29,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-31 22:11:29,031 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 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 20 [2024-10-31 22:11:29,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:29,032 INFO L225 Difference]: With dead ends: 124 [2024-10-31 22:11:29,033 INFO L226 Difference]: Without dead ends: 124 [2024-10-31 22:11:29,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=178, Invalid=751, Unknown=9, NotChecked=118, Total=1056 [2024-10-31 22:11:29,034 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 83 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 4 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:29,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 670 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 470 Invalid, 18 Unknown, 119 Unchecked, 0.6s Time] [2024-10-31 22:11:29,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-31 22:11:29,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-31 22:11:29,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 123 states have internal predecessors, (137), 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-10-31 22:11:29,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2024-10-31 22:11:29,039 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 20 [2024-10-31 22:11:29,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:29,039 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2024-10-31 22:11:29,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 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-10-31 22:11:29,039 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2024-10-31 22:11:29,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-31 22:11:29,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:29,043 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:29,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-31 22:11:29,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-31 22:11:29,243 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:29,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:29,245 INFO L85 PathProgramCache]: Analyzing trace with hash 58337566, now seen corresponding path program 1 times [2024-10-31 22:11:29,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:29,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460992727] [2024-10-31 22:11:29,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:29,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:29,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:29,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460992727] [2024-10-31 22:11:29,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460992727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:29,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:29,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:11:29,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381922944] [2024-10-31 22:11:29,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:29,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:11:29,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:29,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:11:29,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:11:29,427 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-10-31 22:11:29,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:29,664 INFO L93 Difference]: Finished difference Result 198 states and 213 transitions. [2024-10-31 22:11:29,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:11:29,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 21 [2024-10-31 22:11:29,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:29,666 INFO L225 Difference]: With dead ends: 198 [2024-10-31 22:11:29,666 INFO L226 Difference]: Without dead ends: 198 [2024-10-31 22:11:29,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:11:29,667 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 73 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:29,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 242 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:11:29,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-31 22:11:29,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 124. [2024-10-31 22:11:29,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 123 states have internal predecessors, (136), 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-10-31 22:11:29,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2024-10-31 22:11:29,671 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 21 [2024-10-31 22:11:29,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:29,672 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2024-10-31 22:11:29,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-10-31 22:11:29,672 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2024-10-31 22:11:29,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-31 22:11:29,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:29,673 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:29,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:11:29,674 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:29,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:29,674 INFO L85 PathProgramCache]: Analyzing trace with hash 58337567, now seen corresponding path program 1 times [2024-10-31 22:11:29,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:29,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85296340] [2024-10-31 22:11:29,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:29,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:29,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:29,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:29,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85296340] [2024-10-31 22:11:29,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85296340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:29,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:29,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:11:29,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822295988] [2024-10-31 22:11:29,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:29,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:11:29,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:29,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:11:29,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:11:29,925 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-10-31 22:11:30,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:30,166 INFO L93 Difference]: Finished difference Result 200 states and 219 transitions. [2024-10-31 22:11:30,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:11:30,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 21 [2024-10-31 22:11:30,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:30,167 INFO L225 Difference]: With dead ends: 200 [2024-10-31 22:11:30,168 INFO L226 Difference]: Without dead ends: 200 [2024-10-31 22:11:30,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:11:30,168 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 74 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:30,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 221 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:11:30,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-31 22:11:30,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 124. [2024-10-31 22:11:30,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 123 states have internal predecessors, (135), 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-10-31 22:11:30,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2024-10-31 22:11:30,177 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 21 [2024-10-31 22:11:30,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:30,179 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2024-10-31 22:11:30,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-10-31 22:11:30,179 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2024-10-31 22:11:30,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-31 22:11:30,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:30,180 INFO L215 NwaCegarLoop]: trace histogram [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-10-31 22:11:30,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 22:11:30,180 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:30,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:30,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1527252530, now seen corresponding path program 1 times [2024-10-31 22:11:30,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:30,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566299469] [2024-10-31 22:11:30,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:30,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:30,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:30,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566299469] [2024-10-31 22:11:30,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566299469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:30,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:30,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:11:30,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646260658] [2024-10-31 22:11:30,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:30,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:11:30,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:30,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:11:30,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:11:30,629 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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-10-31 22:11:30,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:30,902 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2024-10-31 22:11:30,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-31 22:11:30,902 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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 24 [2024-10-31 22:11:30,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:30,903 INFO L225 Difference]: With dead ends: 152 [2024-10-31 22:11:30,903 INFO L226 Difference]: Without dead ends: 152 [2024-10-31 22:11:30,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-10-31 22:11:30,904 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 36 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:30,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 415 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:11:30,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-31 22:11:30,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 140. [2024-10-31 22:11:30,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 114 states have (on average 1.3333333333333333) internal successors, (152), 139 states have internal predecessors, (152), 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-10-31 22:11:30,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 152 transitions. [2024-10-31 22:11:30,910 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 152 transitions. Word has length 24 [2024-10-31 22:11:30,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:30,910 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 152 transitions. [2024-10-31 22:11:30,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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-10-31 22:11:30,910 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 152 transitions. [2024-10-31 22:11:30,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-31 22:11:30,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:30,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:30,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 22:11:30,911 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:30,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:30,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1189100778, now seen corresponding path program 1 times [2024-10-31 22:11:30,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:30,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114218657] [2024-10-31 22:11:30,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:30,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:31,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:31,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114218657] [2024-10-31 22:11:31,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114218657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:31,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:31,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:11:31,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014904937] [2024-10-31 22:11:31,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:31,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:11:31,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:31,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:11:31,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:11:31,037 INFO L87 Difference]: Start difference. First operand 140 states and 152 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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-10-31 22:11:31,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:31,128 INFO L93 Difference]: Finished difference Result 168 states and 184 transitions. [2024-10-31 22:11:31,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:11:31,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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 26 [2024-10-31 22:11:31,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:31,139 INFO L225 Difference]: With dead ends: 168 [2024-10-31 22:11:31,140 INFO L226 Difference]: Without dead ends: 168 [2024-10-31 22:11:31,140 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-10-31 22:11:31,140 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 73 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:31,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 230 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:11:31,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-31 22:11:31,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 152. [2024-10-31 22:11:31,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 126 states have (on average 1.4047619047619047) internal successors, (177), 151 states have internal predecessors, (177), 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-10-31 22:11:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 177 transitions. [2024-10-31 22:11:31,146 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 177 transitions. Word has length 26 [2024-10-31 22:11:31,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:31,147 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 177 transitions. [2024-10-31 22:11:31,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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-10-31 22:11:31,147 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 177 transitions. [2024-10-31 22:11:31,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-31 22:11:31,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:31,148 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:31,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 22:11:31,148 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:31,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:31,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1792581374, now seen corresponding path program 1 times [2024-10-31 22:11:31,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:31,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139555992] [2024-10-31 22:11:31,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:31,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:31,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:31,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:31,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139555992] [2024-10-31 22:11:31,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139555992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:31,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:31,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:11:31,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336463760] [2024-10-31 22:11:31,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:31,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:11:31,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:31,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:11:31,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:11:31,309 INFO L87 Difference]: Start difference. First operand 152 states and 177 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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-10-31 22:11:31,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:31,470 INFO L93 Difference]: Finished difference Result 218 states and 238 transitions. [2024-10-31 22:11:31,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:11:31,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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 27 [2024-10-31 22:11:31,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:31,472 INFO L225 Difference]: With dead ends: 218 [2024-10-31 22:11:31,472 INFO L226 Difference]: Without dead ends: 218 [2024-10-31 22:11:31,473 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-10-31 22:11:31,473 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 73 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:31,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 258 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:11:31,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-31 22:11:31,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 153. [2024-10-31 22:11:31,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 127 states have (on average 1.4015748031496063) internal successors, (178), 152 states have internal predecessors, (178), 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-10-31 22:11:31,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 178 transitions. [2024-10-31 22:11:31,478 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 178 transitions. Word has length 27 [2024-10-31 22:11:31,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:31,479 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 178 transitions. [2024-10-31 22:11:31,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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-10-31 22:11:31,480 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 178 transitions. [2024-10-31 22:11:31,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-31 22:11:31,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:31,480 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:31,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-31 22:11:31,481 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:31,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:31,481 INFO L85 PathProgramCache]: Analyzing trace with hash 264552428, now seen corresponding path program 1 times [2024-10-31 22:11:31,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:31,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241134193] [2024-10-31 22:11:31,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:31,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:31,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:31,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:31,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241134193] [2024-10-31 22:11:31,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241134193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:31,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:31,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:11:31,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070569685] [2024-10-31 22:11:31,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:31,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:11:31,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:31,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:11:31,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:11:31,647 INFO L87 Difference]: Start difference. First operand 153 states and 178 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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-10-31 22:11:31,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:31,882 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2024-10-31 22:11:31,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:11:31,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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 28 [2024-10-31 22:11:31,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:31,884 INFO L225 Difference]: With dead ends: 221 [2024-10-31 22:11:31,884 INFO L226 Difference]: Without dead ends: 221 [2024-10-31 22:11:31,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:11:31,885 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 64 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:31,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 244 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:11:31,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-31 22:11:31,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 156. [2024-10-31 22:11:31,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 130 states have (on average 1.3923076923076922) internal successors, (181), 155 states have internal predecessors, (181), 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-10-31 22:11:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 181 transitions. [2024-10-31 22:11:31,893 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 181 transitions. Word has length 28 [2024-10-31 22:11:31,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:31,893 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 181 transitions. [2024-10-31 22:11:31,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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-10-31 22:11:31,894 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 181 transitions. [2024-10-31 22:11:31,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-31 22:11:31,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:31,896 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:31,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-31 22:11:31,896 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:31,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:31,897 INFO L85 PathProgramCache]: Analyzing trace with hash -388809147, now seen corresponding path program 1 times [2024-10-31 22:11:31,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:31,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867717935] [2024-10-31 22:11:31,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:31,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:32,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:32,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:32,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867717935] [2024-10-31 22:11:32,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867717935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:32,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:32,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:11:32,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078289722] [2024-10-31 22:11:32,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:32,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:11:32,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:32,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:11:32,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:11:32,217 INFO L87 Difference]: Start difference. First operand 156 states and 181 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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-10-31 22:11:32,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:32,426 INFO L93 Difference]: Finished difference Result 177 states and 195 transitions. [2024-10-31 22:11:32,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:11:32,426 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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 29 [2024-10-31 22:11:32,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:32,427 INFO L225 Difference]: With dead ends: 177 [2024-10-31 22:11:32,427 INFO L226 Difference]: Without dead ends: 177 [2024-10-31 22:11:32,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:11:32,428 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 140 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:32,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 186 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:11:32,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-31 22:11:32,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 157. [2024-10-31 22:11:32,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 131 states have (on average 1.3969465648854962) internal successors, (183), 156 states have internal predecessors, (183), 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-10-31 22:11:32,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 183 transitions. [2024-10-31 22:11:32,434 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 183 transitions. Word has length 29 [2024-10-31 22:11:32,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:32,434 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 183 transitions. [2024-10-31 22:11:32,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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-10-31 22:11:32,435 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 183 transitions. [2024-10-31 22:11:32,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-31 22:11:32,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:32,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:32,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-31 22:11:32,436 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:32,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:32,437 INFO L85 PathProgramCache]: Analyzing trace with hash -388809146, now seen corresponding path program 1 times [2024-10-31 22:11:32,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:32,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194607816] [2024-10-31 22:11:32,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:32,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:32,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:32,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:32,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194607816] [2024-10-31 22:11:32,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194607816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:32,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:32,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:11:32,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475123638] [2024-10-31 22:11:32,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:32,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:11:32,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:32,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:11:32,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:11:32,570 INFO L87 Difference]: Start difference. First operand 157 states and 183 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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-10-31 22:11:32,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:32,642 INFO L93 Difference]: Finished difference Result 152 states and 175 transitions. [2024-10-31 22:11:32,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:11:32,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 29 [2024-10-31 22:11:32,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:32,643 INFO L225 Difference]: With dead ends: 152 [2024-10-31 22:11:32,643 INFO L226 Difference]: Without dead ends: 152 [2024-10-31 22:11:32,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:11:32,644 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 61 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:32,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 56 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:11:32,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-31 22:11:32,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-10-31 22:11:32,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 131 states have (on average 1.3358778625954197) internal successors, (175), 151 states have internal predecessors, (175), 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-10-31 22:11:32,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 175 transitions. [2024-10-31 22:11:32,649 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 175 transitions. Word has length 29 [2024-10-31 22:11:32,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:32,649 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 175 transitions. [2024-10-31 22:11:32,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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-10-31 22:11:32,650 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 175 transitions. [2024-10-31 22:11:32,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-31 22:11:32,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:32,651 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:32,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-31 22:11:32,652 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:32,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:32,653 INFO L85 PathProgramCache]: Analyzing trace with hash -2066056854, now seen corresponding path program 1 times [2024-10-31 22:11:32,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:32,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967062967] [2024-10-31 22:11:32,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:32,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:33,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:33,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967062967] [2024-10-31 22:11:33,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967062967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:33,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:33,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:11:33,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848741099] [2024-10-31 22:11:33,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:33,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 22:11:33,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:33,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 22:11:33,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:11:33,289 INFO L87 Difference]: Start difference. First operand 152 states and 175 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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-10-31 22:11:33,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:33,716 INFO L93 Difference]: Finished difference Result 172 states and 185 transitions. [2024-10-31 22:11:33,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-31 22:11:33,719 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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 29 [2024-10-31 22:11:33,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:33,719 INFO L225 Difference]: With dead ends: 172 [2024-10-31 22:11:33,719 INFO L226 Difference]: Without dead ends: 172 [2024-10-31 22:11:33,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-31 22:11:33,720 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 68 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:33,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 371 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:11:33,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-31 22:11:33,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 152. [2024-10-31 22:11:33,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 131 states have (on average 1.3129770992366412) internal successors, (172), 151 states have internal predecessors, (172), 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-10-31 22:11:33,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 172 transitions. [2024-10-31 22:11:33,725 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 172 transitions. Word has length 29 [2024-10-31 22:11:33,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:33,725 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 172 transitions. [2024-10-31 22:11:33,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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-10-31 22:11:33,725 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 172 transitions. [2024-10-31 22:11:33,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-31 22:11:33,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:33,726 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:33,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-31 22:11:33,726 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:33,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:33,727 INFO L85 PathProgramCache]: Analyzing trace with hash -2066056855, now seen corresponding path program 1 times [2024-10-31 22:11:33,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:33,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018149773] [2024-10-31 22:11:33,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:33,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:34,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:34,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:34,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018149773] [2024-10-31 22:11:34,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018149773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:34,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:34,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:11:34,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530530770] [2024-10-31 22:11:34,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:34,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 22:11:34,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:34,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 22:11:34,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:11:34,119 INFO L87 Difference]: Start difference. First operand 152 states and 172 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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-10-31 22:11:34,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:34,463 INFO L93 Difference]: Finished difference Result 171 states and 186 transitions. [2024-10-31 22:11:34,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-31 22:11:34,464 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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 29 [2024-10-31 22:11:34,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:34,465 INFO L225 Difference]: With dead ends: 171 [2024-10-31 22:11:34,465 INFO L226 Difference]: Without dead ends: 171 [2024-10-31 22:11:34,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-31 22:11:34,465 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 74 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:34,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 340 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:11:34,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-31 22:11:34,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2024-10-31 22:11:34,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 156 states have internal predecessors, (178), 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-10-31 22:11:34,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 178 transitions. [2024-10-31 22:11:34,471 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 178 transitions. Word has length 29 [2024-10-31 22:11:34,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:34,471 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 178 transitions. [2024-10-31 22:11:34,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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-10-31 22:11:34,471 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 178 transitions. [2024-10-31 22:11:34,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-31 22:11:34,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:34,472 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:34,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-31 22:11:34,472 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:34,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:34,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1276636110, now seen corresponding path program 1 times [2024-10-31 22:11:34,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:34,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602309238] [2024-10-31 22:11:34,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:34,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:34,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:34,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602309238] [2024-10-31 22:11:34,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602309238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:34,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:34,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:11:34,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006208040] [2024-10-31 22:11:34,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:34,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:11:34,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:34,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:11:34,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:11:34,554 INFO L87 Difference]: Start difference. First operand 157 states and 178 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 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-10-31 22:11:34,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:34,643 INFO L93 Difference]: Finished difference Result 156 states and 176 transitions. [2024-10-31 22:11:34,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:11:34,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 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 32 [2024-10-31 22:11:34,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:34,644 INFO L225 Difference]: With dead ends: 156 [2024-10-31 22:11:34,644 INFO L226 Difference]: Without dead ends: 156 [2024-10-31 22:11:34,645 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-10-31 22:11:34,645 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 6 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:34,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 249 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:11:34,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-31 22:11:34,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-10-31 22:11:34,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 137 states have (on average 1.2846715328467153) internal successors, (176), 155 states have internal predecessors, (176), 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-10-31 22:11:34,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 176 transitions. [2024-10-31 22:11:34,651 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 176 transitions. Word has length 32 [2024-10-31 22:11:34,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:34,651 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 176 transitions. [2024-10-31 22:11:34,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 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-10-31 22:11:34,652 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 176 transitions. [2024-10-31 22:11:34,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-31 22:11:34,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:34,652 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:34,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-31 22:11:34,653 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:34,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:34,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1276647095, now seen corresponding path program 1 times [2024-10-31 22:11:34,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:34,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595135545] [2024-10-31 22:11:34,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:34,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:35,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:35,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:35,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595135545] [2024-10-31 22:11:35,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595135545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:35,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:35,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:11:35,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127234649] [2024-10-31 22:11:35,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:35,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 22:11:35,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:35,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 22:11:35,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:11:35,180 INFO L87 Difference]: Start difference. First operand 156 states and 176 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 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-10-31 22:11:35,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:35,579 INFO L93 Difference]: Finished difference Result 172 states and 187 transitions. [2024-10-31 22:11:35,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-31 22:11:35,580 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 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 32 [2024-10-31 22:11:35,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:35,581 INFO L225 Difference]: With dead ends: 172 [2024-10-31 22:11:35,581 INFO L226 Difference]: Without dead ends: 172 [2024-10-31 22:11:35,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-31 22:11:35,582 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 64 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:35,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 388 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:11:35,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-31 22:11:35,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 156. [2024-10-31 22:11:35,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 137 states have (on average 1.27007299270073) internal successors, (174), 155 states have internal predecessors, (174), 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-10-31 22:11:35,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 174 transitions. [2024-10-31 22:11:35,587 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 174 transitions. Word has length 32 [2024-10-31 22:11:35,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:35,588 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 174 transitions. [2024-10-31 22:11:35,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 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-10-31 22:11:35,588 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 174 transitions. [2024-10-31 22:11:35,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-31 22:11:35,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:35,589 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:35,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-31 22:11:35,589 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:35,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:35,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1383997955, now seen corresponding path program 2 times [2024-10-31 22:11:35,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:35,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525787580] [2024-10-31 22:11:35,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:35,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:36,547 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:36,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:36,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525787580] [2024-10-31 22:11:36,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525787580] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:11:36,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080482275] [2024-10-31 22:11:36,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-31 22:11:36,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:11:36,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:11:36,551 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:11:36,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-31 22:11:36,722 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-31 22:11:36,723 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-31 22:11:36,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-31 22:11:36,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:11:36,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-31 22:11:36,756 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-10-31 22:11:36,767 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-31 22:11:36,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-31 22:11:36,791 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-10-31 22:11:36,807 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-10-31 22:11:36,990 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-31 22:11:36,991 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-10-31 22:11:37,002 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-10-31 22:11:37,238 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-31 22:11:37,239 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-10-31 22:11:37,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 30 treesize of output 13 [2024-10-31 22:11:37,425 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-31 22:11:37,425 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-10-31 22:11:37,436 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-10-31 22:11:37,535 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-10-31 22:11:37,544 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-10-31 22:11:37,585 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:37,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:11:37,732 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_671) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) is different from false [2024-10-31 22:11:37,767 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_671) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 4)))))) is different from false [2024-10-31 22:11:37,794 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_671) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8)))))) is different from false [2024-10-31 22:11:37,826 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_669) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_668) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_668))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (<= (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_669) .cse2 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_671) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))))) is different from false [2024-10-31 22:11:37,980 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_668))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (<= (+ .cse0 16 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_669) .cse2 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_671) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_669) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_668) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 12)))))) is different from false [2024-10-31 22:11:38,021 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_666 (Array Int Int)) (v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int))) (<= 0 (+ .cse0 12 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_667))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_666) .cse1 v_ArrVal_669) (select (select (store .cse2 .cse1 v_ArrVal_668) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_670))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_666 (Array Int Int)) (v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_667))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_668))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (<= (+ .cse0 16 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_666) .cse4 v_ArrVal_669) .cse5 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_671) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))))))) is different from false [2024-10-31 22:11:38,095 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse4 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_666 (Array Int Int)) (v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_667))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_666) .cse1 v_ArrVal_669) (select (select (store .cse2 .cse1 v_ArrVal_668) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_670))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse4 12))) (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_666 (Array Int Int)) (v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_667))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_668))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_666) .cse5 v_ArrVal_669) .cse6 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse4 16) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_671) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))))))) is different from false [2024-10-31 22:11:38,135 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_666 (Array Int Int)) (v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_667))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_668))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_666) .cse1 v_ArrVal_669) .cse2 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 16) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_671) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_666 (Array Int Int)) (v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_667))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_666) .cse6 v_ArrVal_669) (select (select (store .cse7 .cse6 v_ArrVal_668) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_670))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 12)))))) is different from false [2024-10-31 22:11:38,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:11:38,154 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-10-31 22:11:38,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:11:38,165 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-10-31 22:11:38,183 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 120144 treesize of output 103902 [2024-10-31 22:11:40,074 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 4987 treesize of output 4849 [2024-10-31 22:11:40,106 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 557 treesize of output 461 [2024-10-31 22:11:40,115 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 461 treesize of output 425 [2024-10-31 22:11:40,124 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 425 treesize of output 353 [2024-10-31 22:11:40,135 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 331 treesize of output 311 [2024-10-31 22:11:40,146 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 311 treesize of output 303 [2024-10-31 22:11:40,155 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 325 treesize of output 313 [2024-10-31 22:11:40,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:11:40,284 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-10-31 22:11:40,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:11:40,294 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-10-31 22:11:40,298 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-31 22:11:40,301 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-10-31 22:11:40,305 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-31 22:11:40,308 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-10-31 22:11:40,389 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 28 not checked. [2024-10-31 22:11:40,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080482275] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:11:40,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:11:40,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 15] total 34 [2024-10-31 22:11:40,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246239330] [2024-10-31 22:11:40,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:11:40,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-31 22:11:40,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:40,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-31 22:11:40,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=586, Unknown=9, NotChecked=456, Total=1190 [2024-10-31 22:11:40,393 INFO L87 Difference]: Start difference. First operand 156 states and 174 transitions. Second operand has 35 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 35 states have internal predecessors, (78), 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-10-31 22:11:42,364 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_671) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 4))) (<= 0 (+ .cse3 .cse2)) (<= (+ .cse3 .cse2 4) (select |c_#length| .cse0)) (= (select |c_#valid| |c_ULTIMATE.start_create_data_~data~0#1.base|) 1)))) is different from false [2024-10-31 22:11:42,368 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_671) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 4))) (<= 0 (+ .cse3 .cse2)) (<= (+ .cse3 .cse2 4) (select |c_#length| .cse0))))) is different from false [2024-10-31 22:11:42,384 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 4))) (<= (+ .cse0 |c_ULTIMATE.start_create_data_#t~mem7#1.offset| 4) (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem7#1.base|)) (<= 0 (+ .cse0 |c_ULTIMATE.start_create_data_#t~mem7#1.offset|)) (forall ((v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_671) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) is different from false [2024-10-31 22:11:42,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:42,478 INFO L93 Difference]: Finished difference Result 187 states and 207 transitions. [2024-10-31 22:11:42,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-31 22:11:42,479 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 35 states have internal predecessors, (78), 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 32 [2024-10-31 22:11:42,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:42,479 INFO L225 Difference]: With dead ends: 187 [2024-10-31 22:11:42,480 INFO L226 Difference]: Without dead ends: 187 [2024-10-31 22:11:42,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=317, Invalid=1350, Unknown=17, NotChecked=968, Total=2652 [2024-10-31 22:11:42,481 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 68 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 9 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 790 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:42,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1065 Invalid, 1492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 686 Invalid, 7 Unknown, 790 Unchecked, 0.9s Time] [2024-10-31 22:11:42,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-31 22:11:42,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 180. [2024-10-31 22:11:42,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 161 states have (on average 1.2422360248447204) internal successors, (200), 179 states have internal predecessors, (200), 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-10-31 22:11:42,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 200 transitions. [2024-10-31 22:11:42,486 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 200 transitions. Word has length 32 [2024-10-31 22:11:42,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:42,486 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 200 transitions. [2024-10-31 22:11:42,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 35 states have internal predecessors, (78), 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-10-31 22:11:42,487 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 200 transitions. [2024-10-31 22:11:42,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-31 22:11:42,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:42,487 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:42,509 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-31 22:11:42,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-31 22:11:42,689 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:42,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:42,689 INFO L85 PathProgramCache]: Analyzing trace with hash 921013898, now seen corresponding path program 1 times [2024-10-31 22:11:42,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:42,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021294241] [2024-10-31 22:11:42,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:42,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:42,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:42,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:42,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021294241] [2024-10-31 22:11:42,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021294241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:42,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:42,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:11:42,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310540579] [2024-10-31 22:11:42,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:42,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:11:42,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:42,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:11:42,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:11:42,814 INFO L87 Difference]: Start difference. First operand 180 states and 200 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-10-31 22:11:42,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:42,932 INFO L93 Difference]: Finished difference Result 178 states and 196 transitions. [2024-10-31 22:11:42,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:11:42,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 33 [2024-10-31 22:11:42,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:42,934 INFO L225 Difference]: With dead ends: 178 [2024-10-31 22:11:42,934 INFO L226 Difference]: Without dead ends: 178 [2024-10-31 22:11:42,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:11:42,935 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 49 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:42,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 209 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:11:42,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-31 22:11:42,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-10-31 22:11:42,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 161 states have (on average 1.2173913043478262) internal successors, (196), 177 states have internal predecessors, (196), 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-10-31 22:11:42,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 196 transitions. [2024-10-31 22:11:42,939 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 196 transitions. Word has length 33 [2024-10-31 22:11:42,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:42,940 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 196 transitions. [2024-10-31 22:11:42,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-10-31 22:11:42,940 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 196 transitions. [2024-10-31 22:11:42,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-31 22:11:42,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:42,940 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:42,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-31 22:11:42,941 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-31 22:11:42,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:42,941 INFO L85 PathProgramCache]: Analyzing trace with hash -338052361, now seen corresponding path program 1 times [2024-10-31 22:11:42,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:42,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983490678] [2024-10-31 22:11:42,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:42,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:43,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:43,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:43,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983490678] [2024-10-31 22:11:43,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983490678] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:11:43,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809055369] [2024-10-31 22:11:43,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:43,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:11:43,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:11:43,424 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:11:43,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4fc73c3-de5e-4ca4-8582-4a88276a1525/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-31 22:11:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:43,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-31 22:11:43,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:11:43,851 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-31 22:11:43,851 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15