./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc 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_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme --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 a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:49:39,119 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:49:39,242 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-26 10:49:39,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:49:39,249 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:49:39,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:49:39,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:49:39,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:49:39,279 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:49:39,279 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:49:39,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:49:39,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:49:39,282 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:49:39,282 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:49:39,283 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:49:39,284 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:49:39,284 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:49:39,285 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:49:39,286 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:49:39,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:49:39,287 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 10:49:39,288 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 10:49:39,288 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 10:49:39,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:49:39,290 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 10:49:39,290 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 10:49:39,291 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:49:39,291 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:49:39,292 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:49:39,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:49:39,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 10:49:39,295 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:49:39,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:49:39,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:49:39,296 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:49:39,296 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:49:39,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:49:39,296 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:49:39,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:49:39,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:49:39,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:49:39,298 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_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/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_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme 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 -> a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 [2023-11-26 10:49:39,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:49:39,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:49:39,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:49:39,647 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:49:39,647 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:49:39,648 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2023-11-26 10:49:42,959 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:49:43,189 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:49:43,189 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2023-11-26 10:49:43,204 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/data/11ed6f5fa/9e29e02e40444a4a81d10ff51191a2f8/FLAG8b62b14f9 [2023-11-26 10:49:43,218 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/data/11ed6f5fa/9e29e02e40444a4a81d10ff51191a2f8 [2023-11-26 10:49:43,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:49:43,223 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:49:43,224 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:49:43,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:49:43,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:49:43,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@723a8a59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43, skipping insertion in model container [2023-11-26 10:49:43,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,273 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:49:43,691 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:49:43,703 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:49:43,748 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:49:43,788 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:49:43,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43 WrapperNode [2023-11-26 10:49:43,789 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:49:43,791 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:49:43,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:49:43,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:49:43,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,826 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,863 INFO L138 Inliner]: procedures = 126, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 115 [2023-11-26 10:49:43,865 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:49:43,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:49:43,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:49:43,867 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:49:43,880 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,903 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 10 writes are split as follows [0, 9, 1]. [2023-11-26 10:49:43,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,904 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,914 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,922 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:49:43,927 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:49:43,928 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:49:43,928 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:49:43,929 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43" (1/1) ... [2023-11-26 10:49:43,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:49:43,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:49:43,963 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:49:43,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:49:44,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 10:49:44,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 10:49:44,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 10:49:44,005 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-26 10:49:44,005 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-26 10:49:44,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-26 10:49:44,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:49:44,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 10:49:44,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-26 10:49:44,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-26 10:49:44,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-26 10:49:44,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-26 10:49:44,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-26 10:49:44,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-26 10:49:44,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 10:49:44,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-26 10:49:44,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-26 10:49:44,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-26 10:49:44,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 10:49:44,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 10:49:44,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 10:49:44,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:49:44,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:49:44,234 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:49:44,236 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:49:44,641 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:49:44,697 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:49:44,697 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-26 10:49:44,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:49:44 BoogieIcfgContainer [2023-11-26 10:49:44,700 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:49:44,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:49:44,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:49:44,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:49:44,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:49:43" (1/3) ... [2023-11-26 10:49:44,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb6df40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:49:44, skipping insertion in model container [2023-11-26 10:49:44,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:43" (2/3) ... [2023-11-26 10:49:44,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb6df40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:49:44, skipping insertion in model container [2023-11-26 10:49:44,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:49:44" (3/3) ... [2023-11-26 10:49:44,714 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse.i [2023-11-26 10:49:44,734 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:49:44,734 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2023-11-26 10:49:44,792 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:49:44,800 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@f6b987d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:49:44,801 INFO L358 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2023-11-26 10:49:44,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 41 states have (on average 2.292682926829268) internal successors, (94), 85 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 10:49:44,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-26 10:49:44,813 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:44,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 10:49:44,814 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:49:44,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:44,819 INFO L85 PathProgramCache]: Analyzing trace with hash 181913967, now seen corresponding path program 1 times [2023-11-26 10:49:44,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:44,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653600129] [2023-11-26 10:49:44,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:44,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:45,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:49:45,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:45,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653600129] [2023-11-26 10:49:45,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653600129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:45,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:45,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:49:45,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539088818] [2023-11-26 10:49:45,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:45,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:49:45,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:45,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:49:45,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:49:45,136 INFO L87 Difference]: Start difference. First operand has 89 states, 41 states have (on average 2.292682926829268) internal successors, (94), 85 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:45,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:45,333 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2023-11-26 10:49:45,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:49:45,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-26 10:49:45,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:45,345 INFO L225 Difference]: With dead ends: 85 [2023-11-26 10:49:45,345 INFO L226 Difference]: Without dead ends: 83 [2023-11-26 10:49:45,347 INFO L412 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 [2023-11-26 10:49:45,353 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 8 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:49:45,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 111 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:49:45,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-26 10:49:45,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-11-26 10:49:45,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 39 states have (on average 2.128205128205128) internal successors, (83), 79 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 10:49:45,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2023-11-26 10:49:45,399 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 5 [2023-11-26 10:49:45,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:45,399 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2023-11-26 10:49:45,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:45,400 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2023-11-26 10:49:45,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-26 10:49:45,400 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:45,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 10:49:45,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:49:45,401 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:49:45,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:45,402 INFO L85 PathProgramCache]: Analyzing trace with hash 181913968, now seen corresponding path program 1 times [2023-11-26 10:49:45,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:45,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188199139] [2023-11-26 10:49:45,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:45,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:45,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:49:45,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:45,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188199139] [2023-11-26 10:49:45,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188199139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:45,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:45,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:49:45,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043879080] [2023-11-26 10:49:45,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:45,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:49:45,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:45,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:49:45,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:49:45,592 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:45,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:45,711 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2023-11-26 10:49:45,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:49:45,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-26 10:49:45,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:45,716 INFO L225 Difference]: With dead ends: 80 [2023-11-26 10:49:45,716 INFO L226 Difference]: Without dead ends: 80 [2023-11-26 10:49:45,717 INFO L412 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 [2023-11-26 10:49:45,719 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 3 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:49:45,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 116 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:49:45,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-26 10:49:45,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-26 10:49:45,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 39 states have (on average 2.051282051282051) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 10:49:45,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2023-11-26 10:49:45,734 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 5 [2023-11-26 10:49:45,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:45,734 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2023-11-26 10:49:45,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:49:45,735 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2023-11-26 10:49:45,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-26 10:49:45,736 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:45,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:45,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:49:45,736 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:49:45,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:45,737 INFO L85 PathProgramCache]: Analyzing trace with hash -956323543, now seen corresponding path program 1 times [2023-11-26 10:49:45,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:45,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668673067] [2023-11-26 10:49:45,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:45,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:45,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:49:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:46,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:49:46,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:46,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668673067] [2023-11-26 10:49:46,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668673067] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:46,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:46,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:49:46,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026108074] [2023-11-26 10:49:46,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:46,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:49:46,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:46,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:49:46,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:49:46,059 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 10:49:46,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:46,383 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2023-11-26 10:49:46,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 10:49:46,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-26 10:49:46,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:46,387 INFO L225 Difference]: With dead ends: 84 [2023-11-26 10:49:46,387 INFO L226 Difference]: Without dead ends: 84 [2023-11-26 10:49:46,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:49:46,389 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 7 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:49:46,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 226 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:49:46,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-26 10:49:46,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2023-11-26 10:49:46,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 41 states have (on average 2.048780487804878) internal successors, (84), 78 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 10:49:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2023-11-26 10:49:46,400 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 11 [2023-11-26 10:49:46,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:46,400 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2023-11-26 10:49:46,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 10:49:46,401 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2023-11-26 10:49:46,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-26 10:49:46,401 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:46,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:46,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:49:46,402 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:49:46,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:46,403 INFO L85 PathProgramCache]: Analyzing trace with hash -956323542, now seen corresponding path program 1 times [2023-11-26 10:49:46,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:46,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495767339] [2023-11-26 10:49:46,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:46,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:46,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:49:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:46,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:49:46,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:46,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495767339] [2023-11-26 10:49:46,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495767339] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:46,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:46,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:49:46,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515066387] [2023-11-26 10:49:46,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:46,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:49:46,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:46,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:49:46,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:49:46,512 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 10:49:46,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:46,647 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2023-11-26 10:49:46,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:49:46,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-26 10:49:46,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:46,651 INFO L225 Difference]: With dead ends: 81 [2023-11-26 10:49:46,652 INFO L226 Difference]: Without dead ends: 81 [2023-11-26 10:49:46,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:49:46,663 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 10 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:49:46,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 153 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:49:46,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-26 10:49:46,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-26 10:49:46,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 40 states have (on average 2.025) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 10:49:46,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2023-11-26 10:49:46,672 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 11 [2023-11-26 10:49:46,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:46,678 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2023-11-26 10:49:46,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 10:49:46,679 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2023-11-26 10:49:46,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-26 10:49:46,680 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:46,681 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:46,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:49:46,681 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:49:46,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:46,682 INFO L85 PathProgramCache]: Analyzing trace with hash -422303523, now seen corresponding path program 1 times [2023-11-26 10:49:46,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:46,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074486197] [2023-11-26 10:49:46,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:46,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:46,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:49:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:46,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:49:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:46,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-26 10:49:46,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:46,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074486197] [2023-11-26 10:49:46,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074486197] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:46,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:46,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:49:46,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719455687] [2023-11-26 10:49:46,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:46,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:49:46,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:46,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:49:46,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:49:46,995 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:49:47,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:47,228 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2023-11-26 10:49:47,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 10:49:47,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-11-26 10:49:47,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:47,230 INFO L225 Difference]: With dead ends: 80 [2023-11-26 10:49:47,231 INFO L226 Difference]: Without dead ends: 80 [2023-11-26 10:49:47,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:49:47,232 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 9 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:49:47,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 220 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:49:47,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-26 10:49:47,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-26 10:49:47,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 40 states have (on average 2.0) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 10:49:47,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2023-11-26 10:49:47,246 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 19 [2023-11-26 10:49:47,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:47,247 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2023-11-26 10:49:47,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:49:47,247 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2023-11-26 10:49:47,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-26 10:49:47,248 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:47,248 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:47,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:49:47,249 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:49:47,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:47,249 INFO L85 PathProgramCache]: Analyzing trace with hash -422303522, now seen corresponding path program 1 times [2023-11-26 10:49:47,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:47,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228337787] [2023-11-26 10:49:47,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:47,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:47,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:49:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:47,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:49:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:49:47,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:47,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228337787] [2023-11-26 10:49:47,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228337787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:47,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:47,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:49:47,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131859152] [2023-11-26 10:49:47,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:47,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:49:47,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:47,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:49:47,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:49:47,681 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:49:47,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:47,937 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2023-11-26 10:49:47,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 10:49:47,938 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-11-26 10:49:47,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:47,939 INFO L225 Difference]: With dead ends: 79 [2023-11-26 10:49:47,939 INFO L226 Difference]: Without dead ends: 79 [2023-11-26 10:49:47,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:49:47,941 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 7 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:49:47,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 244 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:49:47,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-26 10:49:47,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-26 10:49:47,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 40 states have (on average 1.975) internal successors, (79), 75 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 10:49:47,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2023-11-26 10:49:47,948 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 19 [2023-11-26 10:49:47,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:47,949 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2023-11-26 10:49:47,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:49:47,949 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2023-11-26 10:49:47,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-26 10:49:47,950 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:47,951 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:47,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 10:49:47,951 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:49:47,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:47,952 INFO L85 PathProgramCache]: Analyzing trace with hash -2106760066, now seen corresponding path program 1 times [2023-11-26 10:49:47,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:47,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729565115] [2023-11-26 10:49:47,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:47,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:48,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:49:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:48,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:49:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:48,377 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:49:48,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:48,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729565115] [2023-11-26 10:49:48,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729565115] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:49:48,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315972926] [2023-11-26 10:49:48,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:48,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:49:48,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:49:48,382 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:49:48,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 10:49:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:48,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-26 10:49:48,575 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:49:48,628 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 [2023-11-26 10:49:48,695 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-26 10:49:48,775 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-26 10:49:48,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-26 10:49:48,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-11-26 10:49:48,793 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:49:48,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315972926] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:49:48,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-26 10:49:48,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2023-11-26 10:49:48,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563657007] [2023-11-26 10:49:48,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-26 10:49:48,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-26 10:49:48,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:48,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-26 10:49:48,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2023-11-26 10:49:48,872 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 11 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-26 10:49:49,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:49,266 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2023-11-26 10:49:49,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 10:49:49,267 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2023-11-26 10:49:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:49,268 INFO L225 Difference]: With dead ends: 86 [2023-11-26 10:49:49,268 INFO L226 Difference]: Without dead ends: 86 [2023-11-26 10:49:49,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2023-11-26 10:49:49,269 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 5 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 10:49:49,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 237 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 326 Invalid, 0 Unknown, 87 Unchecked, 0.3s Time] [2023-11-26 10:49:49,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-26 10:49:49,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2023-11-26 10:49:49,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 79 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:49:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2023-11-26 10:49:49,276 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 21 [2023-11-26 10:49:49,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:49,277 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2023-11-26 10:49:49,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-26 10:49:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2023-11-26 10:49:49,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-26 10:49:49,278 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:49,278 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:49,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-26 10:49:49,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:49:49,491 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:49:49,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:49,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2106760065, now seen corresponding path program 1 times [2023-11-26 10:49:49,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:49,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712192504] [2023-11-26 10:49:49,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:49,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:49,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:49:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:49:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:49:50,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:50,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712192504] [2023-11-26 10:49:50,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712192504] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:49:50,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770401719] [2023-11-26 10:49:50,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:50,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:49:50,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:49:50,167 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:49:50,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 10:49:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-26 10:49:50,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:49:50,354 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 [2023-11-26 10:49:50,361 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 [2023-11-26 10:49:50,577 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-26 10:49:50,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-26 10:49:50,602 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-26 10:49:50,603 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 [2023-11-26 10:49:50,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:49:50,651 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:49:50,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770401719] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:49:50,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-26 10:49:50,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2023-11-26 10:49:50,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076383438] [2023-11-26 10:49:50,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-26 10:49:50,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-26 10:49:50,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:50,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-26 10:49:50,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-11-26 10:49:50,845 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 16 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-26 10:49:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:51,487 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2023-11-26 10:49:51,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 10:49:51,488 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 21 [2023-11-26 10:49:51,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:51,489 INFO L225 Difference]: With dead ends: 86 [2023-11-26 10:49:51,489 INFO L226 Difference]: Without dead ends: 86 [2023-11-26 10:49:51,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2023-11-26 10:49:51,490 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 5 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 10:49:51,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 380 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 10:49:51,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-26 10:49:51,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2023-11-26 10:49:51,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:49:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2023-11-26 10:49:51,497 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 21 [2023-11-26 10:49:51,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:51,497 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2023-11-26 10:49:51,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-26 10:49:51,498 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2023-11-26 10:49:51,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-26 10:49:51,499 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:51,499 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:51,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-26 10:49:51,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:49:51,700 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:49:51,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:51,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1666672876, now seen corresponding path program 1 times [2023-11-26 10:49:51,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:51,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264271089] [2023-11-26 10:49:51,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:51,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:49:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:49:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:49:51,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:51,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264271089] [2023-11-26 10:49:51,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264271089] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:49:51,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930417185] [2023-11-26 10:49:51,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:51,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:49:51,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:49:51,943 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:49:51,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-26 10:49:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:52,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-26 10:49:52,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:49:52,145 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:49:52,145 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:49:52,196 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:49:52,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930417185] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:49:52,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:49:52,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-11-26 10:49:52,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396922824] [2023-11-26 10:49:52,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:49:52,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:49:52,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:52,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:49:52,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:49:52,200 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 10:49:52,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:52,367 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2023-11-26 10:49:52,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 10:49:52,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2023-11-26 10:49:52,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:52,368 INFO L225 Difference]: With dead ends: 85 [2023-11-26 10:49:52,368 INFO L226 Difference]: Without dead ends: 85 [2023-11-26 10:49:52,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:49:52,369 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 3 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:49:52,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 338 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:49:52,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-26 10:49:52,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2023-11-26 10:49:52,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 79 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:49:52,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2023-11-26 10:49:52,374 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 23 [2023-11-26 10:49:52,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:52,375 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2023-11-26 10:49:52,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 10:49:52,375 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2023-11-26 10:49:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-26 10:49:52,376 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:52,376 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:52,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-26 10:49:52,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:49:52,577 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:49:52,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:52,577 INFO L85 PathProgramCache]: Analyzing trace with hash -132032267, now seen corresponding path program 1 times [2023-11-26 10:49:52,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:52,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544652998] [2023-11-26 10:49:52,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:52,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:52,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:49:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:52,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:49:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:52,708 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-26 10:49:52,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:52,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544652998] [2023-11-26 10:49:52,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544652998] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:49:52,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010210907] [2023-11-26 10:49:52,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:52,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:49:52,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:49:52,711 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:49:52,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-26 10:49:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:52,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-26 10:49:52,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:49:52,920 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-26 10:49:52,920 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:49:52,936 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-26 10:49:52,937 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 12 treesize of output 11 [2023-11-26 10:49:52,953 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-26 10:49:52,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010210907] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:49:52,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:49:52,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2023-11-26 10:49:52,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788835261] [2023-11-26 10:49:52,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:49:52,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:49:52,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:52,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:49:52,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:49:52,956 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-26 10:49:53,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:53,133 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2023-11-26 10:49:53,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:49:53,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-11-26 10:49:53,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:53,134 INFO L225 Difference]: With dead ends: 89 [2023-11-26 10:49:53,135 INFO L226 Difference]: Without dead ends: 89 [2023-11-26 10:49:53,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:49:53,135 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 6 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:49:53,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 220 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:49:53,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-26 10:49:53,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2023-11-26 10:49:53,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 47 states have (on average 1.872340425531915) internal successors, (88), 82 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:49:53,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2023-11-26 10:49:53,140 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 24 [2023-11-26 10:49:53,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:53,141 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2023-11-26 10:49:53,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-26 10:49:53,141 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2023-11-26 10:49:53,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-26 10:49:53,142 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:53,142 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:53,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-26 10:49:53,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-26 10:49:53,343 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:49:53,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:53,343 INFO L85 PathProgramCache]: Analyzing trace with hash -132032266, now seen corresponding path program 1 times [2023-11-26 10:49:53,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:53,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741345751] [2023-11-26 10:49:53,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:53,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:53,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:49:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:53,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:49:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:49:53,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:53,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741345751] [2023-11-26 10:49:53,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741345751] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:49:53,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153573997] [2023-11-26 10:49:53,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:53,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:49:53,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:49:53,629 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:49:53,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-26 10:49:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:53,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-26 10:49:53,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:49:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:49:53,941 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:49:53,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 10:49:53,985 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 19 treesize of output 23 [2023-11-26 10:49:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:49:54,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153573997] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:49:54,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:49:54,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2023-11-26 10:49:54,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086673988] [2023-11-26 10:49:54,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:49:54,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-26 10:49:54,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:54,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-26 10:49:54,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-11-26 10:49:54,184 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 16 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-26 10:49:54,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:54,504 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2023-11-26 10:49:54,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 10:49:54,509 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 24 [2023-11-26 10:49:54,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:54,510 INFO L225 Difference]: With dead ends: 91 [2023-11-26 10:49:54,510 INFO L226 Difference]: Without dead ends: 91 [2023-11-26 10:49:54,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-11-26 10:49:54,511 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 17 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 10:49:54,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 581 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 10:49:54,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-26 10:49:54,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2023-11-26 10:49:54,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 47 states have (on average 1.851063829787234) internal successors, (87), 82 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:49:54,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2023-11-26 10:49:54,517 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 24 [2023-11-26 10:49:54,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:54,517 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2023-11-26 10:49:54,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-26 10:49:54,518 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2023-11-26 10:49:54,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-26 10:49:54,518 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:54,519 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:54,533 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-26 10:49:54,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-26 10:49:54,725 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:49:54,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:54,726 INFO L85 PathProgramCache]: Analyzing trace with hash 201967024, now seen corresponding path program 1 times [2023-11-26 10:49:54,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:54,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346829700] [2023-11-26 10:49:54,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:54,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:54,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:49:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:54,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:49:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:54,904 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-26 10:49:54,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:54,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346829700] [2023-11-26 10:49:54,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346829700] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:54,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:54,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 10:49:54,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985500837] [2023-11-26 10:49:54,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:54,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 10:49:54,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:54,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 10:49:54,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:49:54,908 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:49:55,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:55,154 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2023-11-26 10:49:55,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 10:49:55,154 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-11-26 10:49:55,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:55,155 INFO L225 Difference]: With dead ends: 87 [2023-11-26 10:49:55,155 INFO L226 Difference]: Without dead ends: 87 [2023-11-26 10:49:55,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-26 10:49:55,156 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 9 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:49:55,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 248 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:49:55,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-26 10:49:55,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2023-11-26 10:49:55,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 47 states have (on average 1.8297872340425532) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:49:55,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2023-11-26 10:49:55,160 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 25 [2023-11-26 10:49:55,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:55,165 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2023-11-26 10:49:55,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:49:55,165 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2023-11-26 10:49:55,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-26 10:49:55,167 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:55,167 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:55,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 10:49:55,167 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:49:55,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:55,168 INFO L85 PathProgramCache]: Analyzing trace with hash 201967025, now seen corresponding path program 1 times [2023-11-26 10:49:55,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:55,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563577101] [2023-11-26 10:49:55,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:55,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:49:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:49:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,502 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:49:55,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:55,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563577101] [2023-11-26 10:49:55,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563577101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:55,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:55,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 10:49:55,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107592402] [2023-11-26 10:49:55,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:55,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 10:49:55,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:55,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 10:49:55,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:49:55,505 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:49:55,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:55,755 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2023-11-26 10:49:55,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:49:55,756 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-11-26 10:49:55,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:55,757 INFO L225 Difference]: With dead ends: 85 [2023-11-26 10:49:55,757 INFO L226 Difference]: Without dead ends: 85 [2023-11-26 10:49:55,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-26 10:49:55,758 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 7 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:49:55,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 278 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:49:55,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-26 10:49:55,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-11-26 10:49:55,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 47 states have (on average 1.8085106382978724) internal successors, (85), 80 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:49:55,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2023-11-26 10:49:55,762 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 25 [2023-11-26 10:49:55,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:55,762 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2023-11-26 10:49:55,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:49:55,763 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2023-11-26 10:49:55,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-26 10:49:55,763 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:55,763 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:55,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 10:49:55,764 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:49:55,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:55,764 INFO L85 PathProgramCache]: Analyzing trace with hash 816901485, now seen corresponding path program 1 times [2023-11-26 10:49:55,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:55,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738656241] [2023-11-26 10:49:55,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:55,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:49:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:49:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,200 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-26 10:49:56,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:56,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738656241] [2023-11-26 10:49:56,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738656241] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:49:56,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271796872] [2023-11-26 10:49:56,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:56,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:49:56,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:49:56,205 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:49:56,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-26 10:49:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-26 10:49:56,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:49:56,431 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 [2023-11-26 10:49:56,479 WARN L854 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|))))) is different from false [2023-11-26 10:49:56,482 WARN L876 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|))))) is different from true [2023-11-26 10:49:56,501 WARN L854 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) is different from false [2023-11-26 10:49:56,503 WARN L876 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) is different from true [2023-11-26 10:49:56,614 WARN L854 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3)))))))))) is different from false [2023-11-26 10:49:56,620 WARN L876 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse1 (select |c_#valid| .cse1))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3)))))))))) is different from true [2023-11-26 10:49:56,709 WARN L854 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse0 (select |c_#valid| .cse0))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse0)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse2 (select |c_#valid| .cse2))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse2)))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) is different from false [2023-11-26 10:49:56,715 WARN L876 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse0 (select |c_#valid| .cse0))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse0)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse2 (select |c_#valid| .cse2))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse2)))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) is different from true [2023-11-26 10:49:56,828 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) .cse1) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) .cse1))) is different from false [2023-11-26 10:49:56,835 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) .cse1) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) .cse1))) is different from true [2023-11-26 10:49:57,162 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (.cse2 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |c_#valid| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)))))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) .cse0 .cse2) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) .cse2))) is different from false [2023-11-26 10:49:57,168 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (.cse2 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |c_#valid| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)))))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) .cse0 .cse2) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) .cse2))) is different from true [2023-11-26 10:49:57,340 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) (.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) (or (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) .cse0) (and .cse1 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) .cse0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |c_#valid| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2)))))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1))))))) is different from false [2023-11-26 10:49:57,347 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) (.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) (or (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) .cse0) (and .cse1 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) .cse0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |c_#valid| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2)))))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1))))))) is different from true [2023-11-26 10:49:57,348 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2023-11-26 10:49:57,348 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:49:57,940 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:49:57,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271796872] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:49:57,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:49:57,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 25 [2023-11-26 10:49:57,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429399550] [2023-11-26 10:49:57,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:49:57,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-26 10:49:57,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:57,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-26 10:49:57,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=294, Unknown=14, NotChecked=294, Total=702 [2023-11-26 10:49:57,943 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 27 states, 22 states have (on average 2.409090909090909) internal successors, (53), 19 states have internal predecessors, (53), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-26 10:49:58,041 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|))))))) is different from false [2023-11-26 10:49:58,044 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|))))))) is different from true [2023-11-26 10:49:58,049 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))))) is different from false [2023-11-26 10:49:58,052 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))))) is different from true [2023-11-26 10:49:58,092 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse4) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4)))))))))) (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-11-26 10:49:58,097 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse4) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4)))))))))) (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-11-26 10:49:58,129 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse1 (select |c_#valid| .cse1))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2)))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse3 (select |c_#valid| .cse3))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse3)))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse4 (select |c_#valid| .cse4))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))))) is different from false [2023-11-26 10:49:58,134 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse1 (select |c_#valid| .cse1))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2)))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1)))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| .cse3 (select |c_#valid| .cse3))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse3)))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse4 (select |c_#valid| .cse4))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))))) is different from true [2023-11-26 10:49:58,171 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (let ((.cse2 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse1 .cse2) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) .cse2))) (or .cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-11-26 10:49:58,177 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (let ((.cse2 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse1 .cse2) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) .cse2))) (or .cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-11-26 10:49:58,199 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (let ((.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (.cse3 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |c_#valid| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2)))))) (and .cse0 .cse1 .cse3) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) .cse3))))) is different from false [2023-11-26 10:49:58,204 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (let ((.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (.cse3 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |c_#valid| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_old(#valid)_AFTER_CALL_12| .cse2)))))) (and .cse0 .cse1 .cse3) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) .cse3))))) is different from true [2023-11-26 10:49:58,251 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) (and (let ((.cse0 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) (.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) (or (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) .cse0) (and .cse1 .cse2 .cse0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |c_#valid| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3)))))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1))))))) .cse2)) is different from false [2023-11-26 10:49:58,256 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) (and (let ((.cse0 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) (.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) (or (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1))) .cse0) (and .cse1 .cse2 .cse0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_old(#valid)_AFTER_CALL_12|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1)) (= (select |c_#valid| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3)))))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_remove_last_~head#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| (@diff |v_old(#valid)_AFTER_CALL_12| |c_#valid|) 1))))))) .cse2)) is different from true [2023-11-26 10:49:58,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:58,714 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2023-11-26 10:49:58,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-26 10:49:58,715 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 2.409090909090909) internal successors, (53), 19 states have internal predecessors, (53), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 27 [2023-11-26 10:49:58,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:58,716 INFO L225 Difference]: With dead ends: 119 [2023-11-26 10:49:58,716 INFO L226 Difference]: Without dead ends: 119 [2023-11-26 10:49:58,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=134, Invalid=356, Unknown=28, NotChecked=742, Total=1260 [2023-11-26 10:49:58,718 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 167 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1190 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 10:49:58,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 352 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 569 Invalid, 0 Unknown, 1190 Unchecked, 0.5s Time] [2023-11-26 10:49:58,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-26 10:49:58,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2023-11-26 10:49:58,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.8) internal successors, (99), 86 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:49:58,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2023-11-26 10:49:58,723 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 27 [2023-11-26 10:49:58,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:58,723 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2023-11-26 10:49:58,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 2.409090909090909) internal successors, (53), 19 states have internal predecessors, (53), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-26 10:49:58,723 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2023-11-26 10:49:58,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-26 10:49:58,725 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:58,725 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:58,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-26 10:49:58,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-26 10:49:58,937 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:49:58,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:58,937 INFO L85 PathProgramCache]: Analyzing trace with hash 816901486, now seen corresponding path program 1 times [2023-11-26 10:49:58,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:58,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054916953] [2023-11-26 10:49:58,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:58,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:59,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:49:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:59,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:49:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:59,614 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:49:59,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:59,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054916953] [2023-11-26 10:49:59,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054916953] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:49:59,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945836382] [2023-11-26 10:49:59,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:59,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:49:59,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:49:59,617 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:49:59,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-26 10:49:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:59,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-26 10:49:59,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:49:59,843 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 [2023-11-26 10:49:59,886 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 5 treesize of output 3 [2023-11-26 10:49:59,910 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-11-26 10:49:59,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 10:49:59,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2023-11-26 10:49:59,973 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 5 treesize of output 3 [2023-11-26 10:50:00,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 10:50:00,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2023-11-26 10:50:00,121 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-26 10:50:00,122 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:50:00,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945836382] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:50:00,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-26 10:50:00,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 14 [2023-11-26 10:50:00,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856554257] [2023-11-26 10:50:00,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-26 10:50:00,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-26 10:50:00,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:00,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-26 10:50:00,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=250, Unknown=1, NotChecked=32, Total=342 [2023-11-26 10:50:00,302 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand has 16 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-26 10:50:00,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:00,642 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2023-11-26 10:50:00,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 10:50:00,642 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2023-11-26 10:50:00,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:00,643 INFO L225 Difference]: With dead ends: 84 [2023-11-26 10:50:00,643 INFO L226 Difference]: Without dead ends: 84 [2023-11-26 10:50:00,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=370, Unknown=1, NotChecked=40, Total=506 [2023-11-26 10:50:00,644 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 232 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:00,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 111 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 206 Invalid, 0 Unknown, 66 Unchecked, 0.2s Time] [2023-11-26 10:50:00,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-26 10:50:00,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-11-26 10:50:00,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.6) internal successors, (88), 79 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:50:00,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2023-11-26 10:50:00,648 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 27 [2023-11-26 10:50:00,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:00,648 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2023-11-26 10:50:00,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-26 10:50:00,649 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2023-11-26 10:50:00,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-26 10:50:00,649 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:00,650 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:50:00,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-26 10:50:00,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-26 10:50:00,850 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:50:00,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:00,851 INFO L85 PathProgramCache]: Analyzing trace with hash 816901481, now seen corresponding path program 1 times [2023-11-26 10:50:00,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:00,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318085773] [2023-11-26 10:50:00,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:00,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:00,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:00,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:50:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:00,972 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-26 10:50:00,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:00,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318085773] [2023-11-26 10:50:00,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318085773] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:00,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:00,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:50:00,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223364314] [2023-11-26 10:50:00,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:00,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:50:00,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:00,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:50:00,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:50:00,975 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:50:01,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:01,082 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2023-11-26 10:50:01,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:50:01,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2023-11-26 10:50:01,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:01,084 INFO L225 Difference]: With dead ends: 116 [2023-11-26 10:50:01,084 INFO L226 Difference]: Without dead ends: 116 [2023-11-26 10:50:01,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:50:01,085 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 123 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:01,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 137 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:50:01,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-26 10:50:01,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 83. [2023-11-26 10:50:01,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.5740740740740742) internal successors, (85), 78 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:50:01,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2023-11-26 10:50:01,090 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 27 [2023-11-26 10:50:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:01,090 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2023-11-26 10:50:01,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:50:01,090 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2023-11-26 10:50:01,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-26 10:50:01,091 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:01,091 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:50:01,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 10:50:01,092 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:50:01,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:01,092 INFO L85 PathProgramCache]: Analyzing trace with hash -445857719, now seen corresponding path program 1 times [2023-11-26 10:50:01,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:01,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452704516] [2023-11-26 10:50:01,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:01,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:50:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:01,374 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-26 10:50:01,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:01,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452704516] [2023-11-26 10:50:01,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452704516] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:01,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:01,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-26 10:50:01,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651605030] [2023-11-26 10:50:01,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:01,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-26 10:50:01,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:01,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-26 10:50:01,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-26 10:50:01,377 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:50:01,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:01,768 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2023-11-26 10:50:01,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-26 10:50:01,769 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2023-11-26 10:50:01,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:01,770 INFO L225 Difference]: With dead ends: 104 [2023-11-26 10:50:01,770 INFO L226 Difference]: Without dead ends: 104 [2023-11-26 10:50:01,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-26 10:50:01,771 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 52 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:01,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 262 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 10:50:01,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-26 10:50:01,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2023-11-26 10:50:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 79 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:50:01,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2023-11-26 10:50:01,775 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 28 [2023-11-26 10:50:01,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:01,776 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2023-11-26 10:50:01,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:50:01,777 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2023-11-26 10:50:01,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-26 10:50:01,779 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:01,779 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:50:01,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 10:50:01,781 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:50:01,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:01,781 INFO L85 PathProgramCache]: Analyzing trace with hash -445857718, now seen corresponding path program 1 times [2023-11-26 10:50:01,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:01,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682749394] [2023-11-26 10:50:01,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:01,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:02,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:02,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:50:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:02,249 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:50:02,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:02,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682749394] [2023-11-26 10:50:02,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682749394] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:02,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:02,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-26 10:50:02,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021904482] [2023-11-26 10:50:02,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:02,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-26 10:50:02,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:02,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-26 10:50:02,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-26 10:50:02,252 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:50:02,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:02,671 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2023-11-26 10:50:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 10:50:02,672 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2023-11-26 10:50:02,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:02,673 INFO L225 Difference]: With dead ends: 125 [2023-11-26 10:50:02,673 INFO L226 Difference]: Without dead ends: 125 [2023-11-26 10:50:02,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-11-26 10:50:02,674 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 84 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:02,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 355 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 10:50:02,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-26 10:50:02,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 98. [2023-11-26 10:50:02,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.6231884057971016) internal successors, (112), 93 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:50:02,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2023-11-26 10:50:02,678 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 28 [2023-11-26 10:50:02,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:02,679 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2023-11-26 10:50:02,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:50:02,679 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2023-11-26 10:50:02,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-26 10:50:02,680 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:02,680 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:50:02,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 10:50:02,680 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:50:02,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:02,681 INFO L85 PathProgramCache]: Analyzing trace with hash -936683965, now seen corresponding path program 1 times [2023-11-26 10:50:02,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:02,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610774092] [2023-11-26 10:50:02,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:02,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:02,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:02,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:50:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:02,787 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-26 10:50:02,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:02,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610774092] [2023-11-26 10:50:02,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610774092] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:02,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:02,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:50:02,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113577607] [2023-11-26 10:50:02,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:02,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:50:02,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:02,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:50:02,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:50:02,790 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:50:02,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:02,887 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2023-11-26 10:50:02,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:50:02,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-11-26 10:50:02,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:02,888 INFO L225 Difference]: With dead ends: 97 [2023-11-26 10:50:02,889 INFO L226 Difference]: Without dead ends: 97 [2023-11-26 10:50:02,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:50:02,890 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 26 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:02,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 90 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:50:02,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-26 10:50:02,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2023-11-26 10:50:02,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.65625) internal successors, (106), 87 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:50:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2023-11-26 10:50:02,894 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 29 [2023-11-26 10:50:02,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:02,895 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2023-11-26 10:50:02,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:50:02,895 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2023-11-26 10:50:02,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-26 10:50:02,895 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:02,896 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:50:02,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-26 10:50:02,896 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:50:02,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:02,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1789843236, now seen corresponding path program 1 times [2023-11-26 10:50:02,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:02,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255615064] [2023-11-26 10:50:02,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:02,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:50:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:03,383 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:50:03,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:03,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255615064] [2023-11-26 10:50:03,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255615064] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:03,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:03,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-26 10:50:03,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770733393] [2023-11-26 10:50:03,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:03,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-26 10:50:03,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:03,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-26 10:50:03,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2023-11-26 10:50:03,387 INFO L87 Difference]: Start difference. First operand 92 states and 112 transitions. Second operand has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:50:03,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:03,871 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2023-11-26 10:50:03,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-26 10:50:03,872 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2023-11-26 10:50:03,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:03,873 INFO L225 Difference]: With dead ends: 107 [2023-11-26 10:50:03,873 INFO L226 Difference]: Without dead ends: 107 [2023-11-26 10:50:03,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2023-11-26 10:50:03,874 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 66 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:03,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 364 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 10:50:03,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-26 10:50:03,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 94. [2023-11-26 10:50:03,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 67 states have (on average 1.626865671641791) internal successors, (109), 89 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:50:03,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2023-11-26 10:50:03,878 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 31 [2023-11-26 10:50:03,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:03,878 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 115 transitions. [2023-11-26 10:50:03,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:50:03,878 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2023-11-26 10:50:03,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-26 10:50:03,879 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:03,879 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:50:03,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-26 10:50:03,879 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:50:03,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:03,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1789843237, now seen corresponding path program 1 times [2023-11-26 10:50:03,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:03,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337679946] [2023-11-26 10:50:03,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:03,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:04,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:05,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:50:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-26 10:50:05,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:05,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337679946] [2023-11-26 10:50:05,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337679946] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:50:05,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238562612] [2023-11-26 10:50:05,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:05,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:50:05,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:50:05,065 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:50:05,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-26 10:50:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:05,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-26 10:50:05,345 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:50:05,681 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 27 treesize of output 1 [2023-11-26 10:50:05,689 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 19 treesize of output 11 [2023-11-26 10:50:05,789 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 32 treesize of output 20 [2023-11-26 10:50:05,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-26 10:50:05,908 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-26 10:50:05,908 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:50:06,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 10:50:06,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 10:50:06,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 10:50:06,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 10:50:06,175 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 8 treesize of output 4 [2023-11-26 10:50:06,187 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 8 treesize of output 4 [2023-11-26 10:50:06,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 10:50:06,367 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 15 treesize of output 19 [2023-11-26 10:50:06,612 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-26 10:50:06,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238562612] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:50:06,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:50:06,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 11] total 35 [2023-11-26 10:50:06,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116626449] [2023-11-26 10:50:06,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:50:06,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-26 10:50:06,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:06,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-26 10:50:06,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1135, Unknown=0, NotChecked=0, Total=1260 [2023-11-26 10:50:06,617 INFO L87 Difference]: Start difference. First operand 94 states and 115 transitions. Second operand has 36 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 30 states have internal predecessors, (59), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-26 10:50:07,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:07,797 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2023-11-26 10:50:07,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-26 10:50:07,797 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 30 states have internal predecessors, (59), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 31 [2023-11-26 10:50:07,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:07,799 INFO L225 Difference]: With dead ends: 127 [2023-11-26 10:50:07,799 INFO L226 Difference]: Without dead ends: 127 [2023-11-26 10:50:07,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=202, Invalid=1690, Unknown=0, NotChecked=0, Total=1892 [2023-11-26 10:50:07,801 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 220 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:07,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 626 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-26 10:50:07,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-26 10:50:07,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 102. [2023-11-26 10:50:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.5733333333333333) internal successors, (118), 97 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:50:07,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2023-11-26 10:50:07,805 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 31 [2023-11-26 10:50:07,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:07,806 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2023-11-26 10:50:07,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 30 states have internal predecessors, (59), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-26 10:50:07,806 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2023-11-26 10:50:07,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-26 10:50:07,806 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:07,807 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:50:07,822 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-26 10:50:08,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:50:08,017 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:50:08,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:08,018 INFO L85 PathProgramCache]: Analyzing trace with hash -349448386, now seen corresponding path program 1 times [2023-11-26 10:50:08,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:08,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034405022] [2023-11-26 10:50:08,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:08,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:08,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:08,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:50:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:08,313 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:50:08,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:08,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034405022] [2023-11-26 10:50:08,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034405022] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:08,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:08,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-26 10:50:08,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111538788] [2023-11-26 10:50:08,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:08,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-26 10:50:08,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:08,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-26 10:50:08,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-26 10:50:08,316 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:50:08,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:08,660 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2023-11-26 10:50:08,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-26 10:50:08,663 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2023-11-26 10:50:08,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:08,665 INFO L225 Difference]: With dead ends: 101 [2023-11-26 10:50:08,665 INFO L226 Difference]: Without dead ends: 101 [2023-11-26 10:50:08,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-11-26 10:50:08,666 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 86 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:08,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 295 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 10:50:08,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-26 10:50:08,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-11-26 10:50:08,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.56) internal successors, (117), 96 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:50:08,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2023-11-26 10:50:08,672 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 32 [2023-11-26 10:50:08,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:08,673 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2023-11-26 10:50:08,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:50:08,673 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2023-11-26 10:50:08,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-26 10:50:08,674 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:08,674 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:50:08,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-26 10:50:08,674 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:50:08,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:08,675 INFO L85 PathProgramCache]: Analyzing trace with hash 2052509908, now seen corresponding path program 1 times [2023-11-26 10:50:08,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:08,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377176412] [2023-11-26 10:50:08,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:08,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:09,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:09,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:50:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:09,485 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:50:09,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:09,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377176412] [2023-11-26 10:50:09,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377176412] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:50:09,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890522905] [2023-11-26 10:50:09,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:09,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:50:09,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:50:09,488 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:50:09,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-26 10:50:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:09,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-26 10:50:09,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:50:09,933 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 39 treesize of output 1 [2023-11-26 10:50:10,001 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 27 treesize of output 19 [2023-11-26 10:50:10,003 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 23 treesize of output 15 [2023-11-26 10:50:10,038 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 21 treesize of output 9 [2023-11-26 10:50:10,045 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-26 10:50:10,045 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:50:10,155 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 23 [2023-11-26 10:50:10,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 10:50:10,162 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 8 treesize of output 4 [2023-11-26 10:50:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-26 10:50:10,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890522905] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:50:10,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:50:10,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 23 [2023-11-26 10:50:10,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656026993] [2023-11-26 10:50:10,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:50:10,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-26 10:50:10,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:10,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-26 10:50:10,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2023-11-26 10:50:10,258 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand has 24 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-26 10:50:11,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:11,215 INFO L93 Difference]: Finished difference Result 120 states and 141 transitions. [2023-11-26 10:50:11,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-26 10:50:11,215 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 33 [2023-11-26 10:50:11,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:11,216 INFO L225 Difference]: With dead ends: 120 [2023-11-26 10:50:11,216 INFO L226 Difference]: Without dead ends: 120 [2023-11-26 10:50:11,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 49 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=1109, Unknown=0, NotChecked=0, Total=1260 [2023-11-26 10:50:11,218 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 182 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:11,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 561 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-26 10:50:11,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-26 10:50:11,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2023-11-26 10:50:11,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 98 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:50:11,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2023-11-26 10:50:11,223 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 33 [2023-11-26 10:50:11,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:11,223 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2023-11-26 10:50:11,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-26 10:50:11,223 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2023-11-26 10:50:11,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-26 10:50:11,224 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:11,224 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:50:11,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-26 10:50:11,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-26 10:50:11,431 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:50:11,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:11,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2052002020, now seen corresponding path program 1 times [2023-11-26 10:50:11,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:11,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866937271] [2023-11-26 10:50:11,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:11,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:50:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:50:11,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:11,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866937271] [2023-11-26 10:50:11,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866937271] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:11,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:11,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-26 10:50:11,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947337849] [2023-11-26 10:50:11,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:11,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-26 10:50:11,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:11,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-26 10:50:11,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-26 10:50:11,751 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:50:12,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:12,193 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2023-11-26 10:50:12,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-26 10:50:12,193 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2023-11-26 10:50:12,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:12,194 INFO L225 Difference]: With dead ends: 127 [2023-11-26 10:50:12,194 INFO L226 Difference]: Without dead ends: 127 [2023-11-26 10:50:12,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-11-26 10:50:12,195 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 81 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:12,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 347 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 10:50:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-26 10:50:12,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 106. [2023-11-26 10:50:12,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 80 states have (on average 1.5375) internal successors, (123), 101 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:50:12,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 129 transitions. [2023-11-26 10:50:12,203 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 129 transitions. Word has length 33 [2023-11-26 10:50:12,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:12,204 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 129 transitions. [2023-11-26 10:50:12,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:50:12,204 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2023-11-26 10:50:12,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-26 10:50:12,205 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:12,205 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:50:12,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-26 10:50:12,205 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:50:12,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:12,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2059322698, now seen corresponding path program 1 times [2023-11-26 10:50:12,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:12,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758658560] [2023-11-26 10:50:12,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:12,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:50:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 10:50:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,350 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-26 10:50:12,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:12,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758658560] [2023-11-26 10:50:12,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758658560] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:12,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:12,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:50:12,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043752087] [2023-11-26 10:50:12,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:12,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:50:12,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:12,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:50:12,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:50:12,356 INFO L87 Difference]: Start difference. First operand 106 states and 129 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-26 10:50:12,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:12,437 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2023-11-26 10:50:12,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:50:12,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2023-11-26 10:50:12,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:12,438 INFO L225 Difference]: With dead ends: 86 [2023-11-26 10:50:12,438 INFO L226 Difference]: Without dead ends: 86 [2023-11-26 10:50:12,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:50:12,439 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:12,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 116 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:50:12,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-26 10:50:12,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-11-26 10:50:12,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.5076923076923077) internal successors, (98), 82 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 10:50:12,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2023-11-26 10:50:12,444 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 34 [2023-11-26 10:50:12,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:12,444 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2023-11-26 10:50:12,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-26 10:50:12,444 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2023-11-26 10:50:12,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-26 10:50:12,445 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:12,445 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2023-11-26 10:50:12,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-26 10:50:12,446 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:50:12,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:12,446 INFO L85 PathProgramCache]: Analyzing trace with hash -812446720, now seen corresponding path program 1 times [2023-11-26 10:50:12,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:12,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223213193] [2023-11-26 10:50:12,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:12,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:50:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-26 10:50:12,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:12,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223213193] [2023-11-26 10:50:12,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223213193] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:12,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:12,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:50:12,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939313066] [2023-11-26 10:50:12,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:12,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:50:12,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:12,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:50:12,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:50:12,563 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:50:12,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:12,695 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2023-11-26 10:50:12,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:50:12,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2023-11-26 10:50:12,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:12,696 INFO L225 Difference]: With dead ends: 85 [2023-11-26 10:50:12,696 INFO L226 Difference]: Without dead ends: 85 [2023-11-26 10:50:12,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:50:12,697 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 15 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:12,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 136 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:50:12,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-26 10:50:12,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-11-26 10:50:12,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 65 states have (on average 1.4923076923076923) internal successors, (97), 81 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 10:50:12,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2023-11-26 10:50:12,700 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 34 [2023-11-26 10:50:12,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:12,701 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2023-11-26 10:50:12,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:50:12,701 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2023-11-26 10:50:12,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-26 10:50:12,701 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:12,701 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2023-11-26 10:50:12,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-26 10:50:12,702 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:50:12,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:12,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1072036407, now seen corresponding path program 1 times [2023-11-26 10:50:12,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:12,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40798992] [2023-11-26 10:50:12,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:12,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:50:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:12,917 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-26 10:50:12,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:12,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40798992] [2023-11-26 10:50:12,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40798992] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:12,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:12,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 10:50:12,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853176534] [2023-11-26 10:50:12,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:12,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 10:50:12,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:12,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 10:50:12,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-26 10:50:12,920 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:50:13,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:13,101 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2023-11-26 10:50:13,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 10:50:13,102 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2023-11-26 10:50:13,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:13,103 INFO L225 Difference]: With dead ends: 85 [2023-11-26 10:50:13,103 INFO L226 Difference]: Without dead ends: 85 [2023-11-26 10:50:13,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-26 10:50:13,104 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 127 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:13,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 108 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:50:13,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-26 10:50:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2023-11-26 10:50:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 80 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 10:50:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 99 transitions. [2023-11-26 10:50:13,107 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 99 transitions. Word has length 35 [2023-11-26 10:50:13,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:13,107 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 99 transitions. [2023-11-26 10:50:13,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:50:13,108 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2023-11-26 10:50:13,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-26 10:50:13,108 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:13,109 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2023-11-26 10:50:13,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-26 10:50:13,110 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:50:13,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:13,111 INFO L85 PathProgramCache]: Analyzing trace with hash 583955559, now seen corresponding path program 1 times [2023-11-26 10:50:13,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:13,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959921242] [2023-11-26 10:50:13,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:13,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:13,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:13,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:50:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:13,508 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:50:13,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:13,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959921242] [2023-11-26 10:50:13,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959921242] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:50:13,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382122525] [2023-11-26 10:50:13,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:13,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:50:13,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:50:13,513 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:50:13,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-26 10:50:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:13,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-26 10:50:13,835 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:50:13,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 10:50:13,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2023-11-26 10:50:13,954 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-26 10:50:13,955 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:50:13,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382122525] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:13,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 10:50:13,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2023-11-26 10:50:13,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895444528] [2023-11-26 10:50:13,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:13,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:50:13,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:13,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:50:13,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2023-11-26 10:50:13,957 INFO L87 Difference]: Start difference. First operand 84 states and 99 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:50:14,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:14,089 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2023-11-26 10:50:14,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:50:14,090 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2023-11-26 10:50:14,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:14,091 INFO L225 Difference]: With dead ends: 83 [2023-11-26 10:50:14,091 INFO L226 Difference]: Without dead ends: 83 [2023-11-26 10:50:14,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2023-11-26 10:50:14,092 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 82 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:14,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 73 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:50:14,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-26 10:50:14,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-11-26 10:50:14,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 10:50:14,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2023-11-26 10:50:14,095 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 35 [2023-11-26 10:50:14,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:14,095 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2023-11-26 10:50:14,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:50:14,095 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2023-11-26 10:50:14,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-26 10:50:14,096 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:14,096 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2023-11-26 10:50:14,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-26 10:50:14,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-26 10:50:14,303 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:50:14,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:14,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1126609692, now seen corresponding path program 1 times [2023-11-26 10:50:14,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:14,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112858496] [2023-11-26 10:50:14,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:14,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:14,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:14,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:50:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:50:14,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:14,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112858496] [2023-11-26 10:50:14,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112858496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:14,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:14,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-26 10:50:14,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965122722] [2023-11-26 10:50:14,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:14,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-26 10:50:14,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:14,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-26 10:50:14,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2023-11-26 10:50:14,957 INFO L87 Difference]: Start difference. First operand 83 states and 98 transitions. Second operand has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:50:15,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:15,568 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2023-11-26 10:50:15,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-26 10:50:15,568 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2023-11-26 10:50:15,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:15,569 INFO L225 Difference]: With dead ends: 96 [2023-11-26 10:50:15,569 INFO L226 Difference]: Without dead ends: 96 [2023-11-26 10:50:15,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2023-11-26 10:50:15,570 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 48 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:15,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 253 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 10:50:15,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-26 10:50:15,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 86. [2023-11-26 10:50:15,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.4411764705882353) internal successors, (98), 82 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 10:50:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2023-11-26 10:50:15,574 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 36 [2023-11-26 10:50:15,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:15,575 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2023-11-26 10:50:15,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:50:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2023-11-26 10:50:15,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-26 10:50:15,576 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:15,576 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2023-11-26 10:50:15,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-26 10:50:15,576 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:50:15,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:15,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1126609691, now seen corresponding path program 1 times [2023-11-26 10:50:15,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:15,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707031416] [2023-11-26 10:50:15,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:15,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:15,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:15,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:50:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:16,067 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:50:16,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:16,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707031416] [2023-11-26 10:50:16,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707031416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:16,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:16,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-26 10:50:16,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652015511] [2023-11-26 10:50:16,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:16,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-26 10:50:16,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:16,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-26 10:50:16,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-11-26 10:50:16,071 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:50:16,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:16,467 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2023-11-26 10:50:16,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-26 10:50:16,468 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2023-11-26 10:50:16,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:16,469 INFO L225 Difference]: With dead ends: 103 [2023-11-26 10:50:16,469 INFO L226 Difference]: Without dead ends: 103 [2023-11-26 10:50:16,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2023-11-26 10:50:16,475 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 79 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:16,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 335 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 10:50:16,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-26 10:50:16,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 86. [2023-11-26 10:50:16,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.411764705882353) internal successors, (96), 82 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 10:50:16,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2023-11-26 10:50:16,480 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 36 [2023-11-26 10:50:16,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:16,480 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2023-11-26 10:50:16,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 10:50:16,480 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2023-11-26 10:50:16,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-26 10:50:16,481 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:16,481 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2023-11-26 10:50:16,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-26 10:50:16,481 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:50:16,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:16,482 INFO L85 PathProgramCache]: Analyzing trace with hash -340088053, now seen corresponding path program 1 times [2023-11-26 10:50:16,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:16,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841090166] [2023-11-26 10:50:16,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:16,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:50:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-26 10:50:17,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:17,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841090166] [2023-11-26 10:50:17,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841090166] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:50:17,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230482623] [2023-11-26 10:50:17,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:17,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:50:17,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:50:17,629 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:50:17,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-26 10:50:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 74 conjunts are in the unsatisfiable core [2023-11-26 10:50:17,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:50:18,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-26 10:50:18,344 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 19 treesize of output 18 [2023-11-26 10:50:18,404 INFO L349 Elim1Store]: treesize reduction 57, result has 20.8 percent of original size [2023-11-26 10:50:18,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 45 [2023-11-26 10:50:18,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-26 10:50:18,815 INFO L349 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2023-11-26 10:50:18,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 52 [2023-11-26 10:50:18,936 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 15 treesize of output 7 [2023-11-26 10:50:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-26 10:50:18,942 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:50:18,953 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-26 10:50:18,953 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 12 treesize of output 11 [2023-11-26 10:50:19,241 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 54 treesize of output 42 [2023-11-26 10:50:19,244 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 41 treesize of output 33 [2023-11-26 10:50:19,450 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 228 treesize of output 220 [2023-11-26 10:50:19,883 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:50:19,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230482623] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:50:19,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:50:19,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 20] total 51 [2023-11-26 10:50:19,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130189927] [2023-11-26 10:50:19,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:50:19,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-26 10:50:19,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:19,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-26 10:50:19,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2435, Unknown=0, NotChecked=0, Total=2652 [2023-11-26 10:50:19,887 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand has 52 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 45 states have internal predecessors, (76), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-26 10:50:21,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:21,397 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2023-11-26 10:50:21,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-26 10:50:21,397 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 45 states have internal predecessors, (76), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2023-11-26 10:50:21,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:21,398 INFO L225 Difference]: With dead ends: 95 [2023-11-26 10:50:21,398 INFO L226 Difference]: Without dead ends: 95 [2023-11-26 10:50:21,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=431, Invalid=3859, Unknown=0, NotChecked=0, Total=4290 [2023-11-26 10:50:21,401 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 139 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:21,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 739 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-26 10:50:21,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-26 10:50:21,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2023-11-26 10:50:21,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 84 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 10:50:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2023-11-26 10:50:21,405 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 38 [2023-11-26 10:50:21,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:21,405 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2023-11-26 10:50:21,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 45 states have internal predecessors, (76), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-26 10:50:21,406 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2023-11-26 10:50:21,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-26 10:50:21,406 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:21,406 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2023-11-26 10:50:21,415 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-26 10:50:21,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:50:21,615 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2023-11-26 10:50:21,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:21,615 INFO L85 PathProgramCache]: Analyzing trace with hash -340088052, now seen corresponding path program 1 times [2023-11-26 10:50:21,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:21,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293422818] [2023-11-26 10:50:21,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:21,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-26 10:50:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,759 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:50:23,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:23,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293422818] [2023-11-26 10:50:23,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293422818] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:50:23,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639766485] [2023-11-26 10:50:23,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:23,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:50:23,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:50:23,765 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:50:23,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f38b9d9-eea7-47a3-8f04-300ca7d40440/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-26 10:50:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 82 conjunts are in the unsatisfiable core [2023-11-26 10:50:24,131 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:50:24,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-26 10:50:24,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-26 10:50:24,690 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 28 treesize of output 23 [2023-11-26 10:50:24,704 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 19 treesize of output 18 [2023-11-26 10:50:24,799 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-26 10:50:24,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 48 [2023-11-26 10:50:24,816 INFO L349 Elim1Store]: treesize reduction 37, result has 43.9 percent of original size [2023-11-26 10:50:24,816 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 47 treesize of output 40 [2023-11-26 10:50:25,329 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 113 treesize of output 69