./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB --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 74e63e86abbcab22438f70ee6d7d7ef12eaada509b0f0a56fb5cf815aaf53aab --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:28:06,409 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:28:06,507 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-27 23:28:06,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:28:06,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:28:06,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:28:06,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:28:06,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:28:06,549 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 23:28:06,549 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 23:28:06,550 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:28:06,550 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:28:06,550 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:28:06,551 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:28:06,553 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:28:06,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:28:06,553 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 23:28:06,553 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 23:28:06,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 23:28:06,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:28:06,554 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 23:28:06,554 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 23:28:06,554 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 23:28:06,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:28:06,554 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 23:28:06,555 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 23:28:06,555 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 23:28:06,555 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:28:06,555 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:28:06,555 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:28:06,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:28:06,556 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:28:06,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:28:06,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:28:06,556 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:28:06,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:28:06,556 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:28:06,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:28:06,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:28:06,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:28:06,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:28:06,557 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 23:28:06,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 23:28:06,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:28:06,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:28:06,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:28:06,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:28:06,557 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 74e63e86abbcab22438f70ee6d7d7ef12eaada509b0f0a56fb5cf815aaf53aab [2024-11-27 23:28:06,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:28:06,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:28:06,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:28:06,911 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:28:06,912 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:28:06,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2024-11-27 23:28:09,972 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB/data/e182d7535/e5254c4ee889499f8fcdf3ac52ec6fad/FLAG1d210d8fe [2024-11-27 23:28:10,292 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:28:10,293 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2024-11-27 23:28:10,316 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB/data/e182d7535/e5254c4ee889499f8fcdf3ac52ec6fad/FLAG1d210d8fe [2024-11-27 23:28:10,339 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB/data/e182d7535/e5254c4ee889499f8fcdf3ac52ec6fad [2024-11-27 23:28:10,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:28:10,344 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:28:10,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:28:10,346 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:28:10,350 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:28:10,351 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:28:10" (1/1) ... [2024-11-27 23:28:10,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b4023a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:10, skipping insertion in model container [2024-11-27 23:28:10,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:28:10" (1/1) ... [2024-11-27 23:28:10,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:28:10,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:28:10,975 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:28:11,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:28:11,150 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:28:11,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:11 WrapperNode [2024-11-27 23:28:11,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:28:11,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:28:11,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:28:11,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:28:11,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:11" (1/1) ... [2024-11-27 23:28:11,192 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:11" (1/1) ... [2024-11-27 23:28:11,241 INFO L138 Inliner]: procedures = 184, calls = 145, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 236 [2024-11-27 23:28:11,241 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:28:11,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:28:11,242 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:28:11,242 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:28:11,251 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:11" (1/1) ... [2024-11-27 23:28:11,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:11" (1/1) ... [2024-11-27 23:28:11,257 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:11" (1/1) ... [2024-11-27 23:28:11,283 INFO L175 MemorySlicer]: Split 91 memory accesses to 3 slices as follows [2, 70, 19]. 77 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 0, 9]. The 44 writes are split as follows [0, 38, 6]. [2024-11-27 23:28:11,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:11" (1/1) ... [2024-11-27 23:28:11,283 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:11" (1/1) ... [2024-11-27 23:28:11,301 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:11" (1/1) ... [2024-11-27 23:28:11,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:11" (1/1) ... [2024-11-27 23:28:11,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:11" (1/1) ... [2024-11-27 23:28:11,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:11" (1/1) ... [2024-11-27 23:28:11,311 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:11" (1/1) ... [2024-11-27 23:28:11,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:28:11,323 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:28:11,323 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:28:11,323 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:28:11,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:11" (1/1) ... [2024-11-27 23:28:11,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:28:11,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:28:11,367 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:28:11,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:28:11,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-27 23:28:11,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-27 23:28:11,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-27 23:28:11,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-11-27 23:28:11,405 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-11-27 23:28:11,405 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2024-11-27 23:28:11,405 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2024-11-27 23:28:11,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-27 23:28:11,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-27 23:28:11,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-27 23:28:11,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 23:28:11,406 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2024-11-27 23:28:11,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2024-11-27 23:28:11,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 23:28:11,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-27 23:28:11,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-27 23:28:11,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-27 23:28:11,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 23:28:11,407 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2024-11-27 23:28:11,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2024-11-27 23:28:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure status_update [2024-11-27 23:28:11,408 INFO L138 BoogieDeclarations]: Found implementation of procedure status_update [2024-11-27 23:28:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2024-11-27 23:28:11,408 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2024-11-27 23:28:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-27 23:28:11,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-27 23:28:11,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-27 23:28:11,409 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2024-11-27 23:28:11,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2024-11-27 23:28:11,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 23:28:11,409 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2024-11-27 23:28:11,410 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2024-11-27 23:28:11,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 23:28:11,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-27 23:28:11,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-27 23:28:11,412 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2024-11-27 23:28:11,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2024-11-27 23:28:11,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:28:11,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:28:11,635 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:28:11,638 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:28:12,801 INFO L? ?]: Removed 322 outVars from TransFormulas that were not future-live. [2024-11-27 23:28:12,801 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:28:12,821 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:28:12,821 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-27 23:28:12,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:28:12 BoogieIcfgContainer [2024-11-27 23:28:12,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:28:12,824 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:28:12,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:28:12,831 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:28:12,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:28:10" (1/3) ... [2024-11-27 23:28:12,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f64f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:28:12, skipping insertion in model container [2024-11-27 23:28:12,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:11" (2/3) ... [2024-11-27 23:28:12,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f64f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:28:12, skipping insertion in model container [2024-11-27 23:28:12,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:28:12" (3/3) ... [2024-11-27 23:28:12,833 INFO L128 eAbstractionObserver]: Analyzing ICFG system-with-recursion.i [2024-11-27 23:28:12,849 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:28:12,852 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG system-with-recursion.i that has 10 procedures, 387 locations, 1 initial locations, 1 loop locations, and 158 error locations. [2024-11-27 23:28:12,899 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:28:12,911 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7a2cd255, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:28:12,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 158 error locations. [2024-11-27 23:28:12,916 INFO L276 IsEmpty]: Start isEmpty. Operand has 387 states, 190 states have (on average 1.9842105263157894) internal successors, (377), 348 states have internal predecessors, (377), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-27 23:28:12,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-27 23:28:12,922 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:12,923 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:12,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-27 23:28:12,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:12,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1798451593, now seen corresponding path program 1 times [2024-11-27 23:28:12,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:12,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520472749] [2024-11-27 23:28:12,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:12,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:13,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:13,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:13,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520472749] [2024-11-27 23:28:13,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520472749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:13,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:28:13,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:28:13,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459801097] [2024-11-27 23:28:13,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:13,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:28:13,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:13,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:28:13,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:28:13,249 INFO L87 Difference]: Start difference. First operand has 387 states, 190 states have (on average 1.9842105263157894) internal successors, (377), 348 states have internal predecessors, (377), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-27 23:28:13,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:13,831 INFO L93 Difference]: Finished difference Result 414 states and 479 transitions. [2024-11-27 23:28:13,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:28:13,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 7 [2024-11-27 23:28:13,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:13,852 INFO L225 Difference]: With dead ends: 414 [2024-11-27 23:28:13,852 INFO L226 Difference]: Without dead ends: 412 [2024-11-27 23:28:13,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:28:13,858 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 386 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:13,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 281 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 23:28:13,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-27 23:28:13,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 380. [2024-11-27 23:28:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 202 states have (on average 1.8415841584158417) internal successors, (372), 336 states have internal predecessors, (372), 32 states have call successors, (32), 11 states have call predecessors, (32), 11 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2024-11-27 23:28:13,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 441 transitions. [2024-11-27 23:28:13,976 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 441 transitions. Word has length 7 [2024-11-27 23:28:13,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:13,976 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 441 transitions. [2024-11-27 23:28:13,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-27 23:28:13,977 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 441 transitions. [2024-11-27 23:28:13,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-27 23:28:13,977 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:13,978 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:13,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 23:28:13,978 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-27 23:28:13,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:13,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1798451592, now seen corresponding path program 1 times [2024-11-27 23:28:13,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:13,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885364820] [2024-11-27 23:28:13,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:13,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:14,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:14,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:14,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885364820] [2024-11-27 23:28:14,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885364820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:14,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:28:14,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:28:14,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429946294] [2024-11-27 23:28:14,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:14,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:28:14,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:14,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:28:14,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:28:14,264 INFO L87 Difference]: Start difference. First operand 380 states and 441 transitions. Second operand has 4 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-27 23:28:14,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:14,759 INFO L93 Difference]: Finished difference Result 377 states and 437 transitions. [2024-11-27 23:28:14,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:28:14,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 7 [2024-11-27 23:28:14,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:14,763 INFO L225 Difference]: With dead ends: 377 [2024-11-27 23:28:14,763 INFO L226 Difference]: Without dead ends: 377 [2024-11-27 23:28:14,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:28:14,764 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 13 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:14,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 843 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 23:28:14,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-27 23:28:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2024-11-27 23:28:14,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 204 states have (on average 1.803921568627451) internal successors, (368), 332 states have internal predecessors, (368), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2024-11-27 23:28:14,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 437 transitions. [2024-11-27 23:28:14,802 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 437 transitions. Word has length 7 [2024-11-27 23:28:14,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:14,802 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 437 transitions. [2024-11-27 23:28:14,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-27 23:28:14,802 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 437 transitions. [2024-11-27 23:28:14,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-27 23:28:14,802 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:14,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:14,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 23:28:14,803 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-27 23:28:14,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:14,807 INFO L85 PathProgramCache]: Analyzing trace with hash -996852037, now seen corresponding path program 1 times [2024-11-27 23:28:14,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:14,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353095337] [2024-11-27 23:28:14,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:14,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:15,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:15,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:15,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353095337] [2024-11-27 23:28:15,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353095337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:15,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:28:15,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 23:28:15,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870282153] [2024-11-27 23:28:15,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:15,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 23:28:15,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:15,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 23:28:15,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:28:15,122 INFO L87 Difference]: Start difference. First operand 377 states and 437 transitions. Second operand has 5 states, 4 states have (on average 2.25) 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) [2024-11-27 23:28:15,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:15,625 INFO L93 Difference]: Finished difference Result 376 states and 436 transitions. [2024-11-27 23:28:15,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 23:28:15,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) 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 [2024-11-27 23:28:15,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:15,629 INFO L225 Difference]: With dead ends: 376 [2024-11-27 23:28:15,629 INFO L226 Difference]: Without dead ends: 376 [2024-11-27 23:28:15,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:28:15,630 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 2 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:15,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1102 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 23:28:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-11-27 23:28:15,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2024-11-27 23:28:15,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 204 states have (on average 1.7990196078431373) internal successors, (367), 331 states have internal predecessors, (367), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2024-11-27 23:28:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 436 transitions. [2024-11-27 23:28:15,652 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 436 transitions. Word has length 11 [2024-11-27 23:28:15,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:15,652 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 436 transitions. [2024-11-27 23:28:15,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) 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) [2024-11-27 23:28:15,652 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 436 transitions. [2024-11-27 23:28:15,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-27 23:28:15,653 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:15,653 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:15,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 23:28:15,653 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-27 23:28:15,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:15,654 INFO L85 PathProgramCache]: Analyzing trace with hash -996852036, now seen corresponding path program 1 times [2024-11-27 23:28:15,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:15,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341981724] [2024-11-27 23:28:15,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:15,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:15,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:15,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:15,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341981724] [2024-11-27 23:28:15,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341981724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:15,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:28:15,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 23:28:15,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441799940] [2024-11-27 23:28:15,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:15,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 23:28:15,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:15,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 23:28:15,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:28:15,960 INFO L87 Difference]: Start difference. First operand 376 states and 436 transitions. Second operand has 5 states, 4 states have (on average 2.25) 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) [2024-11-27 23:28:16,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:16,517 INFO L93 Difference]: Finished difference Result 375 states and 435 transitions. [2024-11-27 23:28:16,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 23:28:16,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) 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 [2024-11-27 23:28:16,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:16,519 INFO L225 Difference]: With dead ends: 375 [2024-11-27 23:28:16,519 INFO L226 Difference]: Without dead ends: 375 [2024-11-27 23:28:16,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:28:16,520 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 1 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:16,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1083 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 23:28:16,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-27 23:28:16,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2024-11-27 23:28:16,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 204 states have (on average 1.7941176470588236) internal successors, (366), 330 states have internal predecessors, (366), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2024-11-27 23:28:16,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 435 transitions. [2024-11-27 23:28:16,535 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 435 transitions. Word has length 11 [2024-11-27 23:28:16,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:16,536 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 435 transitions. [2024-11-27 23:28:16,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) 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) [2024-11-27 23:28:16,537 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 435 transitions. [2024-11-27 23:28:16,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-27 23:28:16,537 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:16,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:16,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 23:28:16,537 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-27 23:28:16,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:16,538 INFO L85 PathProgramCache]: Analyzing trace with hash -880937440, now seen corresponding path program 1 times [2024-11-27 23:28:16,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:16,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442682907] [2024-11-27 23:28:16,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:16,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:16,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:16,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:16,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442682907] [2024-11-27 23:28:16,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442682907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:16,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:28:16,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:28:16,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686506715] [2024-11-27 23:28:16,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:16,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:28:16,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:16,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:28:16,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:28:16,633 INFO L87 Difference]: Start difference. First operand 375 states and 435 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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) [2024-11-27 23:28:16,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:16,862 INFO L93 Difference]: Finished difference Result 374 states and 434 transitions. [2024-11-27 23:28:16,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:28:16,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2024-11-27 23:28:16,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:16,866 INFO L225 Difference]: With dead ends: 374 [2024-11-27 23:28:16,867 INFO L226 Difference]: Without dead ends: 374 [2024-11-27 23:28:16,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:28:16,868 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 1 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:16,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 635 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:28:16,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-27 23:28:16,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2024-11-27 23:28:16,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 204 states have (on average 1.7892156862745099) internal successors, (365), 329 states have internal predecessors, (365), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2024-11-27 23:28:16,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 434 transitions. [2024-11-27 23:28:16,891 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 434 transitions. Word has length 17 [2024-11-27 23:28:16,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:16,891 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 434 transitions. [2024-11-27 23:28:16,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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) [2024-11-27 23:28:16,892 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 434 transitions. [2024-11-27 23:28:16,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-27 23:28:16,895 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:16,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:16,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 23:28:16,896 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-27 23:28:16,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:16,896 INFO L85 PathProgramCache]: Analyzing trace with hash -880937439, now seen corresponding path program 1 times [2024-11-27 23:28:16,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:16,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863445422] [2024-11-27 23:28:16,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:16,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:17,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:17,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863445422] [2024-11-27 23:28:17,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863445422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:17,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:28:17,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:28:17,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018608860] [2024-11-27 23:28:17,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:17,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:28:17,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:17,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:28:17,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:28:17,055 INFO L87 Difference]: Start difference. First operand 374 states and 434 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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) [2024-11-27 23:28:17,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:17,336 INFO L93 Difference]: Finished difference Result 373 states and 433 transitions. [2024-11-27 23:28:17,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:28:17,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2024-11-27 23:28:17,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:17,339 INFO L225 Difference]: With dead ends: 373 [2024-11-27 23:28:17,339 INFO L226 Difference]: Without dead ends: 373 [2024-11-27 23:28:17,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:28:17,342 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 1 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:17,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 622 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 23:28:17,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-27 23:28:17,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2024-11-27 23:28:17,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 204 states have (on average 1.7843137254901962) internal successors, (364), 328 states have internal predecessors, (364), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2024-11-27 23:28:17,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 433 transitions. [2024-11-27 23:28:17,369 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 433 transitions. Word has length 17 [2024-11-27 23:28:17,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:17,369 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 433 transitions. [2024-11-27 23:28:17,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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) [2024-11-27 23:28:17,369 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 433 transitions. [2024-11-27 23:28:17,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-27 23:28:17,370 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:17,370 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:17,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 23:28:17,370 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-27 23:28:17,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:17,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1756576041, now seen corresponding path program 1 times [2024-11-27 23:28:17,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:17,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718955668] [2024-11-27 23:28:17,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:17,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:17,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:17,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:17,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718955668] [2024-11-27 23:28:17,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718955668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:17,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:28:17,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:28:17,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418057552] [2024-11-27 23:28:17,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:17,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 23:28:17,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:17,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 23:28:17,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:28:17,663 INFO L87 Difference]: Start difference. First operand 373 states and 433 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:28:18,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:18,423 INFO L93 Difference]: Finished difference Result 386 states and 449 transitions. [2024-11-27 23:28:18,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 23:28:18,424 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-27 23:28:18,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:18,425 INFO L225 Difference]: With dead ends: 386 [2024-11-27 23:28:18,426 INFO L226 Difference]: Without dead ends: 386 [2024-11-27 23:28:18,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-27 23:28:18,426 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 1016 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:18,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 331 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-27 23:28:18,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-27 23:28:18,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 354. [2024-11-27 23:28:18,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 309 states have internal predecessors, (343), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2024-11-27 23:28:18,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 412 transitions. [2024-11-27 23:28:18,440 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 412 transitions. Word has length 20 [2024-11-27 23:28:18,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:18,440 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 412 transitions. [2024-11-27 23:28:18,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:28:18,441 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 412 transitions. [2024-11-27 23:28:18,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-27 23:28:18,441 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:18,441 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:18,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 23:28:18,442 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-27 23:28:18,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:18,442 INFO L85 PathProgramCache]: Analyzing trace with hash 83868256, now seen corresponding path program 1 times [2024-11-27 23:28:18,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:18,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903214649] [2024-11-27 23:28:18,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:18,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:18,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:18,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:18,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903214649] [2024-11-27 23:28:18,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903214649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:18,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:28:18,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:28:18,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075246961] [2024-11-27 23:28:18,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:18,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 23:28:18,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:18,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 23:28:18,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:28:18,701 INFO L87 Difference]: Start difference. First operand 354 states and 412 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:28:19,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:19,355 INFO L93 Difference]: Finished difference Result 387 states and 458 transitions. [2024-11-27 23:28:19,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 23:28:19,356 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-27 23:28:19,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:19,358 INFO L225 Difference]: With dead ends: 387 [2024-11-27 23:28:19,358 INFO L226 Difference]: Without dead ends: 387 [2024-11-27 23:28:19,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-27 23:28:19,359 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 43 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:19,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 1427 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-27 23:28:19,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-27 23:28:19,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 375. [2024-11-27 23:28:19,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 222 states have (on average 1.662162162162162) internal successors, (369), 327 states have internal predecessors, (369), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (40), 33 states have call predecessors, (40), 33 states have call successors, (40) [2024-11-27 23:28:19,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 442 transitions. [2024-11-27 23:28:19,374 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 442 transitions. Word has length 26 [2024-11-27 23:28:19,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:19,374 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 442 transitions. [2024-11-27 23:28:19,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:28:19,374 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 442 transitions. [2024-11-27 23:28:19,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-27 23:28:19,375 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:19,375 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:19,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 23:28:19,377 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-27 23:28:19,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:19,377 INFO L85 PathProgramCache]: Analyzing trace with hash 83868257, now seen corresponding path program 1 times [2024-11-27 23:28:19,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:19,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788507216] [2024-11-27 23:28:19,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:19,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:19,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:19,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:19,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788507216] [2024-11-27 23:28:19,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788507216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:19,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:28:19,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:28:19,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989308025] [2024-11-27 23:28:19,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:19,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 23:28:19,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:19,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 23:28:19,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:28:19,798 INFO L87 Difference]: Start difference. First operand 375 states and 442 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:28:20,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:20,545 INFO L93 Difference]: Finished difference Result 386 states and 457 transitions. [2024-11-27 23:28:20,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 23:28:20,546 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-27 23:28:20,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:20,548 INFO L225 Difference]: With dead ends: 386 [2024-11-27 23:28:20,548 INFO L226 Difference]: Without dead ends: 386 [2024-11-27 23:28:20,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-27 23:28:20,549 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 42 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:20,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1461 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-27 23:28:20,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-27 23:28:20,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 375. [2024-11-27 23:28:20,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 222 states have (on average 1.6576576576576576) internal successors, (368), 327 states have internal predecessors, (368), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (40), 33 states have call predecessors, (40), 33 states have call successors, (40) [2024-11-27 23:28:20,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 441 transitions. [2024-11-27 23:28:20,568 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 441 transitions. Word has length 26 [2024-11-27 23:28:20,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:20,569 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 441 transitions. [2024-11-27 23:28:20,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:28:20,569 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 441 transitions. [2024-11-27 23:28:20,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-27 23:28:20,570 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:20,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:20,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 23:28:20,571 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-27 23:28:20,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:20,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1697872296, now seen corresponding path program 1 times [2024-11-27 23:28:20,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:20,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917487078] [2024-11-27 23:28:20,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:20,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:20,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:20,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:20,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917487078] [2024-11-27 23:28:20,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917487078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:20,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:28:20,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:28:20,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111838504] [2024-11-27 23:28:20,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:20,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 23:28:20,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:20,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 23:28:20,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:28:20,907 INFO L87 Difference]: Start difference. First operand 375 states and 441 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:28:21,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:21,158 INFO L93 Difference]: Finished difference Result 425 states and 492 transitions. [2024-11-27 23:28:21,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 23:28:21,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-27 23:28:21,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:21,161 INFO L225 Difference]: With dead ends: 425 [2024-11-27 23:28:21,161 INFO L226 Difference]: Without dead ends: 425 [2024-11-27 23:28:21,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-27 23:28:21,162 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 58 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:21,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1737 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:28:21,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-27 23:28:21,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 413. [2024-11-27 23:28:21,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 251 states have (on average 1.6015936254980079) internal successors, (402), 356 states have internal predecessors, (402), 37 states have call successors, (37), 18 states have call predecessors, (37), 19 states have return successors, (50), 38 states have call predecessors, (50), 37 states have call successors, (50) [2024-11-27 23:28:21,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 489 transitions. [2024-11-27 23:28:21,178 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 489 transitions. Word has length 27 [2024-11-27 23:28:21,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:21,179 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 489 transitions. [2024-11-27 23:28:21,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:28:21,179 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 489 transitions. [2024-11-27 23:28:21,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-27 23:28:21,180 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:21,180 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:21,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 23:28:21,180 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-27 23:28:21,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:21,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1466731203, now seen corresponding path program 1 times [2024-11-27 23:28:21,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:21,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953269693] [2024-11-27 23:28:21,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:21,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:21,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:21,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:21,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953269693] [2024-11-27 23:28:21,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953269693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:21,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:28:21,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 23:28:21,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623919972] [2024-11-27 23:28:21,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:21,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:28:21,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:21,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:28:21,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:28:21,301 INFO L87 Difference]: Start difference. First operand 413 states and 489 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 23:28:21,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:21,375 INFO L93 Difference]: Finished difference Result 423 states and 499 transitions. [2024-11-27 23:28:21,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 23:28:21,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2024-11-27 23:28:21,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:21,378 INFO L225 Difference]: With dead ends: 423 [2024-11-27 23:28:21,378 INFO L226 Difference]: Without dead ends: 421 [2024-11-27 23:28:21,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:28:21,379 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 12 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:21,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1075 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:28:21,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-27 23:28:21,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-11-27 23:28:21,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 258 states have (on average 1.5891472868217054) internal successors, (410), 363 states have internal predecessors, (410), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (50), 38 states have call predecessors, (50), 37 states have call successors, (50) [2024-11-27 23:28:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 497 transitions. [2024-11-27 23:28:21,395 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 497 transitions. Word has length 38 [2024-11-27 23:28:21,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:21,396 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 497 transitions. [2024-11-27 23:28:21,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 23:28:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 497 transitions. [2024-11-27 23:28:21,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-27 23:28:21,397 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:21,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:21,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 23:28:21,397 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-27 23:28:21,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:21,398 INFO L85 PathProgramCache]: Analyzing trace with hash -850465204, now seen corresponding path program 1 times [2024-11-27 23:28:21,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:21,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994811743] [2024-11-27 23:28:21,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:21,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:21,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:21,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:21,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994811743] [2024-11-27 23:28:21,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994811743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:21,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:28:21,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-27 23:28:21,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106105447] [2024-11-27 23:28:21,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:21,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 23:28:21,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:21,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 23:28:21,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-27 23:28:21,759 INFO L87 Difference]: Start difference. First operand 421 states and 497 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-27 23:28:22,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:22,522 INFO L93 Difference]: Finished difference Result 465 states and 564 transitions. [2024-11-27 23:28:22,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 23:28:22,522 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2024-11-27 23:28:22,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:22,524 INFO L225 Difference]: With dead ends: 465 [2024-11-27 23:28:22,525 INFO L226 Difference]: Without dead ends: 458 [2024-11-27 23:28:22,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-27 23:28:22,525 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 289 mSDsluCounter, 2048 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 2370 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:22,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 2370 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-27 23:28:22,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-27 23:28:22,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 423. [2024-11-27 23:28:22,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 259 states have (on average 1.583011583011583) internal successors, (410), 365 states have internal predecessors, (410), 37 states have call successors, (37), 19 states have call predecessors, (37), 21 states have return successors, (51), 38 states have call predecessors, (51), 37 states have call successors, (51) [2024-11-27 23:28:22,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 498 transitions. [2024-11-27 23:28:22,542 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 498 transitions. Word has length 37 [2024-11-27 23:28:22,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:22,542 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 498 transitions. [2024-11-27 23:28:22,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-27 23:28:22,543 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 498 transitions. [2024-11-27 23:28:22,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-27 23:28:22,543 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:22,543 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:22,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 23:28:22,544 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-27 23:28:22,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:22,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1140093467, now seen corresponding path program 1 times [2024-11-27 23:28:22,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:22,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370983809] [2024-11-27 23:28:22,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:22,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:22,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:22,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:22,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370983809] [2024-11-27 23:28:22,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370983809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:22,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:28:22,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-27 23:28:22,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755225514] [2024-11-27 23:28:22,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:22,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 23:28:22,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:22,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 23:28:22,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-27 23:28:22,866 INFO L87 Difference]: Start difference. First operand 423 states and 498 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 23:28:24,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:24,149 INFO L93 Difference]: Finished difference Result 604 states and 805 transitions. [2024-11-27 23:28:24,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-27 23:28:24,149 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2024-11-27 23:28:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:24,155 INFO L225 Difference]: With dead ends: 604 [2024-11-27 23:28:24,155 INFO L226 Difference]: Without dead ends: 598 [2024-11-27 23:28:24,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2024-11-27 23:28:24,157 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 448 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 2128 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:24,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 2128 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-27 23:28:24,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-11-27 23:28:24,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 527. [2024-11-27 23:28:24,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 339 states have (on average 1.519174041297935) internal successors, (515), 440 states have internal predecessors, (515), 49 states have call successors, (49), 24 states have call predecessors, (49), 33 states have return successors, (117), 62 states have call predecessors, (117), 49 states have call successors, (117) [2024-11-27 23:28:24,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 681 transitions. [2024-11-27 23:28:24,200 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 681 transitions. Word has length 40 [2024-11-27 23:28:24,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:24,200 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 681 transitions. [2024-11-27 23:28:24,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 23:28:24,201 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 681 transitions. [2024-11-27 23:28:24,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-27 23:28:24,203 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:24,203 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:24,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 23:28:24,204 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-27 23:28:24,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:24,204 INFO L85 PathProgramCache]: Analyzing trace with hash 884069767, now seen corresponding path program 1 times [2024-11-27 23:28:24,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:24,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333289930] [2024-11-27 23:28:24,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:24,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:25,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:25,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:25,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333289930] [2024-11-27 23:28:25,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333289930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:25,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:28:25,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 23:28:25,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915024578] [2024-11-27 23:28:25,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:25,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 23:28:25,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:25,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 23:28:25,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-27 23:28:25,118 INFO L87 Difference]: Start difference. First operand 527 states and 681 transitions. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 23:28:26,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:26,463 INFO L93 Difference]: Finished difference Result 808 states and 1143 transitions. [2024-11-27 23:28:26,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 23:28:26,464 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2024-11-27 23:28:26,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:26,470 INFO L225 Difference]: With dead ends: 808 [2024-11-27 23:28:26,470 INFO L226 Difference]: Without dead ends: 806 [2024-11-27 23:28:26,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-27 23:28:26,471 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 550 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:26,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1318 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-27 23:28:26,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-11-27 23:28:26,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 662. [2024-11-27 23:28:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 444 states have (on average 1.481981981981982) internal successors, (658), 546 states have internal predecessors, (658), 64 states have call successors, (64), 32 states have call predecessors, (64), 48 states have return successors, (180), 83 states have call predecessors, (180), 64 states have call successors, (180) [2024-11-27 23:28:26,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 902 transitions. [2024-11-27 23:28:26,513 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 902 transitions. Word has length 42 [2024-11-27 23:28:26,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:26,514 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 902 transitions. [2024-11-27 23:28:26,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 23:28:26,514 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 902 transitions. [2024-11-27 23:28:26,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-27 23:28:26,515 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:26,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:26,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 23:28:26,516 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-27 23:28:26,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:26,517 INFO L85 PathProgramCache]: Analyzing trace with hash 884069768, now seen corresponding path program 1 times [2024-11-27 23:28:26,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:26,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427351554] [2024-11-27 23:28:26,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:26,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:28,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:28,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:28,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427351554] [2024-11-27 23:28:28,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427351554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:28,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:28:28,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-27 23:28:28,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358142726] [2024-11-27 23:28:28,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:28,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 23:28:28,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:28,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 23:28:28,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-27 23:28:28,061 INFO L87 Difference]: Start difference. First operand 662 states and 902 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 23:28:29,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:29,617 INFO L93 Difference]: Finished difference Result 879 states and 1194 transitions. [2024-11-27 23:28:29,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-27 23:28:29,618 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2024-11-27 23:28:29,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:29,623 INFO L225 Difference]: With dead ends: 879 [2024-11-27 23:28:29,623 INFO L226 Difference]: Without dead ends: 879 [2024-11-27 23:28:29,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-11-27 23:28:29,624 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 956 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:29,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 1118 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-27 23:28:29,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2024-11-27 23:28:29,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 676. [2024-11-27 23:28:29,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 457 states have (on average 1.4660831509846828) internal successors, (670), 551 states have internal predecessors, (670), 61 states have call successors, (61), 32 states have call predecessors, (61), 52 states have return successors, (198), 92 states have call predecessors, (198), 61 states have call successors, (198) [2024-11-27 23:28:29,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 929 transitions. [2024-11-27 23:28:29,673 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 929 transitions. Word has length 42 [2024-11-27 23:28:29,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:29,674 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 929 transitions. [2024-11-27 23:28:29,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 23:28:29,674 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 929 transitions. [2024-11-27 23:28:29,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-27 23:28:29,675 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:29,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:29,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-27 23:28:29,677 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-27 23:28:29,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:29,678 INFO L85 PathProgramCache]: Analyzing trace with hash -812476152, now seen corresponding path program 1 times [2024-11-27 23:28:29,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:29,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57711837] [2024-11-27 23:28:29,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:29,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:29,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:29,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:29,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57711837] [2024-11-27 23:28:29,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57711837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:29,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:28:29,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:28:29,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776497969] [2024-11-27 23:28:29,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:29,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:28:29,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:29,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:28:29,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:28:29,797 INFO L87 Difference]: Start difference. First operand 676 states and 929 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 23:28:30,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:30,045 INFO L93 Difference]: Finished difference Result 674 states and 925 transitions. [2024-11-27 23:28:30,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:28:30,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2024-11-27 23:28:30,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:30,050 INFO L225 Difference]: With dead ends: 674 [2024-11-27 23:28:30,051 INFO L226 Difference]: Without dead ends: 674 [2024-11-27 23:28:30,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:28:30,051 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 5 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:30,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 582 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:28:30,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2024-11-27 23:28:30,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2024-11-27 23:28:30,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 457 states have (on average 1.4573304157549234) internal successors, (666), 549 states have internal predecessors, (666), 61 states have call successors, (61), 32 states have call predecessors, (61), 52 states have return successors, (198), 92 states have call predecessors, (198), 61 states have call successors, (198) [2024-11-27 23:28:30,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 925 transitions. [2024-11-27 23:28:30,084 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 925 transitions. Word has length 44 [2024-11-27 23:28:30,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:30,084 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 925 transitions. [2024-11-27 23:28:30,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 23:28:30,085 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 925 transitions. [2024-11-27 23:28:30,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-27 23:28:30,087 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:30,087 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:30,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-27 23:28:30,087 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-27 23:28:30,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:30,088 INFO L85 PathProgramCache]: Analyzing trace with hash -812476151, now seen corresponding path program 1 times [2024-11-27 23:28:30,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:30,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001842660] [2024-11-27 23:28:30,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:30,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:30,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:30,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:30,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001842660] [2024-11-27 23:28:30,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001842660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:30,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:28:30,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:28:30,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050755251] [2024-11-27 23:28:30,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:30,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:28:30,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:30,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:28:30,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:28:30,242 INFO L87 Difference]: Start difference. First operand 674 states and 925 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 23:28:30,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:30,472 INFO L93 Difference]: Finished difference Result 672 states and 921 transitions. [2024-11-27 23:28:30,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:28:30,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2024-11-27 23:28:30,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:30,476 INFO L225 Difference]: With dead ends: 672 [2024-11-27 23:28:30,477 INFO L226 Difference]: Without dead ends: 672 [2024-11-27 23:28:30,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:28:30,477 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 5 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:30,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 588 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:28:30,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2024-11-27 23:28:30,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2024-11-27 23:28:30,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 457 states have (on average 1.4485776805251642) internal successors, (662), 547 states have internal predecessors, (662), 61 states have call successors, (61), 32 states have call predecessors, (61), 52 states have return successors, (198), 92 states have call predecessors, (198), 61 states have call successors, (198) [2024-11-27 23:28:30,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 921 transitions. [2024-11-27 23:28:30,511 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 921 transitions. Word has length 44 [2024-11-27 23:28:30,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:30,511 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 921 transitions. [2024-11-27 23:28:30,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 23:28:30,512 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 921 transitions. [2024-11-27 23:28:30,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-27 23:28:30,512 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:30,513 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:30,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-27 23:28:30,513 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-27 23:28:30,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:30,514 INFO L85 PathProgramCache]: Analyzing trace with hash 148800592, now seen corresponding path program 1 times [2024-11-27 23:28:30,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:30,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571988973] [2024-11-27 23:28:30,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:30,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:31,042 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:31,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:31,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571988973] [2024-11-27 23:28:31,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571988973] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:28:31,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51797484] [2024-11-27 23:28:31,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:31,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:28:31,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:28:31,047 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:28:31,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 23:28:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:31,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-27 23:28:31,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:28:31,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 23:28:31,496 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 [2024-11-27 23:28:31,549 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:31,549 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:28:31,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51797484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:31,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 23:28:31,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 19 [2024-11-27 23:28:31,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528085486] [2024-11-27 23:28:31,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:31,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 23:28:31,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:31,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 23:28:31,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2024-11-27 23:28:31,551 INFO L87 Difference]: Start difference. First operand 672 states and 921 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 23:28:32,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:32,263 INFO L93 Difference]: Finished difference Result 882 states and 1297 transitions. [2024-11-27 23:28:32,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 23:28:32,264 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2024-11-27 23:28:32,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:32,272 INFO L225 Difference]: With dead ends: 882 [2024-11-27 23:28:32,272 INFO L226 Difference]: Without dead ends: 878 [2024-11-27 23:28:32,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2024-11-27 23:28:32,273 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 193 mSDsluCounter, 2096 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 2488 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:32,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 2488 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-27 23:28:32,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2024-11-27 23:28:32,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 833. [2024-11-27 23:28:32,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 583 states have (on average 1.4168096054888508) internal successors, (826), 665 states have internal predecessors, (826), 77 states have call successors, (77), 40 states have call predecessors, (77), 71 states have return successors, (349), 127 states have call predecessors, (349), 77 states have call successors, (349) [2024-11-27 23:28:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1252 transitions. [2024-11-27 23:28:32,327 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1252 transitions. Word has length 53 [2024-11-27 23:28:32,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:32,327 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1252 transitions. [2024-11-27 23:28:32,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 23:28:32,328 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1252 transitions. [2024-11-27 23:28:32,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-27 23:28:32,328 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:32,328 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:32,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 23:28:32,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-27 23:28:32,533 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-27 23:28:32,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:32,534 INFO L85 PathProgramCache]: Analyzing trace with hash 315030120, now seen corresponding path program 1 times [2024-11-27 23:28:32,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:32,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845842108] [2024-11-27 23:28:32,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:32,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:32,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:32,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:32,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845842108] [2024-11-27 23:28:32,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845842108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:32,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:28:32,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:28:32,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337627834] [2024-11-27 23:28:32,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:32,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 23:28:32,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:32,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 23:28:32,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:28:32,719 INFO L87 Difference]: Start difference. First operand 833 states and 1252 transitions. Second operand has 7 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 23:28:33,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:33,481 INFO L93 Difference]: Finished difference Result 1028 states and 1639 transitions. [2024-11-27 23:28:33,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 23:28:33,482 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2024-11-27 23:28:33,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:33,489 INFO L225 Difference]: With dead ends: 1028 [2024-11-27 23:28:33,489 INFO L226 Difference]: Without dead ends: 1028 [2024-11-27 23:28:33,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-27 23:28:33,490 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 182 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:33,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1371 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-27 23:28:33,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2024-11-27 23:28:33,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 941. [2024-11-27 23:28:33,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 671 states have (on average 1.4157973174366616) internal successors, (950), 759 states have internal predecessors, (950), 89 states have call successors, (89), 50 states have call predecessors, (89), 79 states have return successors, (430), 131 states have call predecessors, (430), 89 states have call successors, (430) [2024-11-27 23:28:33,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1469 transitions. [2024-11-27 23:28:33,537 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1469 transitions. Word has length 54 [2024-11-27 23:28:33,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:33,537 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1469 transitions. [2024-11-27 23:28:33,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 23:28:33,538 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1469 transitions. [2024-11-27 23:28:33,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-27 23:28:33,538 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:33,538 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:33,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-27 23:28:33,539 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-27 23:28:33,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:33,540 INFO L85 PathProgramCache]: Analyzing trace with hash 315030121, now seen corresponding path program 1 times [2024-11-27 23:28:33,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:33,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108515802] [2024-11-27 23:28:33,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:33,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:33,940 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:33,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:33,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108515802] [2024-11-27 23:28:33,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108515802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:33,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:28:33,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:28:33,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871246557] [2024-11-27 23:28:33,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:33,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 23:28:33,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:33,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 23:28:33,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:28:33,943 INFO L87 Difference]: Start difference. First operand 941 states and 1469 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 23:28:34,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:34,685 INFO L93 Difference]: Finished difference Result 1011 states and 1592 transitions. [2024-11-27 23:28:34,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 23:28:34,686 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2024-11-27 23:28:34,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:34,693 INFO L225 Difference]: With dead ends: 1011 [2024-11-27 23:28:34,693 INFO L226 Difference]: Without dead ends: 1011 [2024-11-27 23:28:34,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-27 23:28:34,694 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 53 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:34,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1477 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-27 23:28:34,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2024-11-27 23:28:34,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 989. [2024-11-27 23:28:34,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 713 states have (on average 1.4109396914446002) internal successors, (1006), 801 states have internal predecessors, (1006), 91 states have call successors, (91), 54 states have call predecessors, (91), 83 states have return successors, (438), 133 states have call predecessors, (438), 91 states have call successors, (438) [2024-11-27 23:28:34,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1535 transitions. [2024-11-27 23:28:34,745 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1535 transitions. Word has length 54 [2024-11-27 23:28:34,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:34,745 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1535 transitions. [2024-11-27 23:28:34,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 23:28:34,746 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1535 transitions. [2024-11-27 23:28:34,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-27 23:28:34,746 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:34,746 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:34,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-27 23:28:34,747 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-27 23:28:34,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:34,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1173721710, now seen corresponding path program 1 times [2024-11-27 23:28:34,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:34,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804191776] [2024-11-27 23:28:34,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:34,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:35,040 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:35,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:35,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804191776] [2024-11-27 23:28:35,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804191776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:35,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:28:35,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 23:28:35,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906118792] [2024-11-27 23:28:35,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:35,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 23:28:35,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:35,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 23:28:35,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-27 23:28:35,042 INFO L87 Difference]: Start difference. First operand 989 states and 1535 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 23:28:35,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:35,606 INFO L93 Difference]: Finished difference Result 1115 states and 1764 transitions. [2024-11-27 23:28:35,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 23:28:35,607 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2024-11-27 23:28:35,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:35,615 INFO L225 Difference]: With dead ends: 1115 [2024-11-27 23:28:35,616 INFO L226 Difference]: Without dead ends: 1115 [2024-11-27 23:28:35,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-27 23:28:35,617 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 116 mSDsluCounter, 2217 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 2633 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:35,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 2633 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 23:28:35,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2024-11-27 23:28:35,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1093. [2024-11-27 23:28:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 793 states have (on average 1.3682219419924337) internal successors, (1085), 873 states have internal predecessors, (1085), 95 states have call successors, (95), 58 states have call predecessors, (95), 103 states have return successors, (571), 161 states have call predecessors, (571), 95 states have call successors, (571) [2024-11-27 23:28:35,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1751 transitions. [2024-11-27 23:28:35,669 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1751 transitions. Word has length 55 [2024-11-27 23:28:35,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:35,670 INFO L471 AbstractCegarLoop]: Abstraction has 1093 states and 1751 transitions. [2024-11-27 23:28:35,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 23:28:35,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1751 transitions. [2024-11-27 23:28:35,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-27 23:28:35,671 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:35,671 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:35,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-27 23:28:35,671 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-27 23:28:35,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:35,673 INFO L85 PathProgramCache]: Analyzing trace with hash -337077908, now seen corresponding path program 1 times [2024-11-27 23:28:35,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:35,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265874173] [2024-11-27 23:28:35,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:35,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-27 23:28:35,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:35,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265874173] [2024-11-27 23:28:35,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265874173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:35,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:28:35,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:28:35,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339579688] [2024-11-27 23:28:35,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:35,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:28:35,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:35,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:28:35,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:28:35,810 INFO L87 Difference]: Start difference. First operand 1093 states and 1751 transitions. Second operand has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 23:28:36,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:36,137 INFO L93 Difference]: Finished difference Result 1091 states and 1749 transitions. [2024-11-27 23:28:36,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:28:36,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 62 [2024-11-27 23:28:36,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:36,146 INFO L225 Difference]: With dead ends: 1091 [2024-11-27 23:28:36,146 INFO L226 Difference]: Without dead ends: 1091 [2024-11-27 23:28:36,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:28:36,150 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 2 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:36,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 796 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 23:28:36,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2024-11-27 23:28:36,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1091. [2024-11-27 23:28:36,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 793 states have (on average 1.3656998738965953) internal successors, (1083), 871 states have internal predecessors, (1083), 95 states have call successors, (95), 58 states have call predecessors, (95), 103 states have return successors, (571), 161 states have call predecessors, (571), 95 states have call successors, (571) [2024-11-27 23:28:36,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1749 transitions. [2024-11-27 23:28:36,223 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1749 transitions. Word has length 62 [2024-11-27 23:28:36,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:36,223 INFO L471 AbstractCegarLoop]: Abstraction has 1091 states and 1749 transitions. [2024-11-27 23:28:36,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 23:28:36,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1749 transitions. [2024-11-27 23:28:36,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-27 23:28:36,228 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:36,228 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:36,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-27 23:28:36,229 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-27 23:28:36,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:36,230 INFO L85 PathProgramCache]: Analyzing trace with hash -337077907, now seen corresponding path program 1 times [2024-11-27 23:28:36,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:36,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621622614] [2024-11-27 23:28:36,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:36,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:36,579 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 23:28:36,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:36,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621622614] [2024-11-27 23:28:36,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621622614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:36,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:28:36,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 23:28:36,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194406970] [2024-11-27 23:28:36,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:36,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 23:28:36,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:36,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 23:28:36,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-27 23:28:36,581 INFO L87 Difference]: Start difference. First operand 1091 states and 1749 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 23:28:36,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:36,874 INFO L93 Difference]: Finished difference Result 1348 states and 2221 transitions. [2024-11-27 23:28:36,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 23:28:36,874 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 62 [2024-11-27 23:28:36,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:36,883 INFO L225 Difference]: With dead ends: 1348 [2024-11-27 23:28:36,883 INFO L226 Difference]: Without dead ends: 1348 [2024-11-27 23:28:36,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-27 23:28:36,884 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 92 mSDsluCounter, 2506 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 2887 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:36,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 2887 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:28:36,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2024-11-27 23:28:36,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1284. [2024-11-27 23:28:36,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 958 states have (on average 1.350730688935282) internal successors, (1294), 1037 states have internal predecessors, (1294), 107 states have call successors, (107), 77 states have call predecessors, (107), 119 states have return successors, (644), 169 states have call predecessors, (644), 107 states have call successors, (644) [2024-11-27 23:28:36,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 2045 transitions. [2024-11-27 23:28:36,952 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 2045 transitions. Word has length 62 [2024-11-27 23:28:36,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:36,952 INFO L471 AbstractCegarLoop]: Abstraction has 1284 states and 2045 transitions. [2024-11-27 23:28:36,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 23:28:36,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 2045 transitions. [2024-11-27 23:28:36,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-27 23:28:36,953 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:36,953 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:36,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-27 23:28:36,954 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-27 23:28:36,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:36,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1986376205, now seen corresponding path program 1 times [2024-11-27 23:28:36,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:36,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240335716] [2024-11-27 23:28:36,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:36,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:38,214 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 23:28:38,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:38,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240335716] [2024-11-27 23:28:38,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240335716] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:28:38,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921407717] [2024-11-27 23:28:38,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:38,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:28:38,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:28:38,219 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:28:38,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 23:28:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:38,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-27 23:28:38,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:28:38,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-27 23:28:38,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 23:28:38,618 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 1 [2024-11-27 23:28:38,668 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 29 treesize of output 13 [2024-11-27 23:28:38,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-27 23:28:38,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:28:38,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 71 [2024-11-27 23:28:38,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2024-11-27 23:28:38,773 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 51 treesize of output 32 [2024-11-27 23:28:38,865 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 47 treesize of output 29 [2024-11-27 23:28:38,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-27 23:28:38,883 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 46 treesize of output 28 [2024-11-27 23:28:38,920 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 51 treesize of output 29 [2024-11-27 23:28:38,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-27 23:28:38,940 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 50 treesize of output 28 [2024-11-27 23:28:38,985 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 51 treesize of output 29 [2024-11-27 23:28:39,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-27 23:28:39,008 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 50 treesize of output 28 [2024-11-27 23:28:39,229 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 [2024-11-27 23:28:39,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-27 23:28:39,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 23:28:39,404 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 47 treesize of output 29 [2024-11-27 23:28:39,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-27 23:28:39,423 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 46 treesize of output 28 [2024-11-27 23:28:39,488 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 23 [2024-11-27 23:28:39,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2024-11-27 23:28:39,537 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:28:39,537 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:28:39,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921407717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:39,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 23:28:39,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 20 [2024-11-27 23:28:39,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913446510] [2024-11-27 23:28:39,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:39,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 23:28:39,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:39,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 23:28:39,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-11-27 23:28:39,539 INFO L87 Difference]: Start difference. First operand 1284 states and 2045 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-27 23:28:40,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:40,579 INFO L93 Difference]: Finished difference Result 1281 states and 2029 transitions. [2024-11-27 23:28:40,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-27 23:28:40,580 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2024-11-27 23:28:40,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:40,588 INFO L225 Difference]: With dead ends: 1281 [2024-11-27 23:28:40,588 INFO L226 Difference]: Without dead ends: 1281 [2024-11-27 23:28:40,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-27 23:28:40,590 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 652 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:40,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 1572 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-27 23:28:40,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2024-11-27 23:28:40,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1265. [2024-11-27 23:28:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 941 states have (on average 1.3528161530286928) internal successors, (1273), 1020 states have internal predecessors, (1273), 106 states have call successors, (106), 76 states have call predecessors, (106), 118 states have return successors, (635), 168 states have call predecessors, (635), 106 states have call successors, (635) [2024-11-27 23:28:40,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 2014 transitions. [2024-11-27 23:28:40,647 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 2014 transitions. Word has length 62 [2024-11-27 23:28:40,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:40,647 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 2014 transitions. [2024-11-27 23:28:40,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-27 23:28:40,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 2014 transitions. [2024-11-27 23:28:40,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-27 23:28:40,648 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:40,648 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:40,658 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-27 23:28:40,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:28:40,854 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ASStartErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-27 23:28:40,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:40,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1411772222, now seen corresponding path program 1 times [2024-11-27 23:28:40,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:40,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634076178] [2024-11-27 23:28:40,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:40,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:41,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-27 23:28:41,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:41,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634076178] [2024-11-27 23:28:41,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634076178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:41,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:28:41,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:28:41,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611384317] [2024-11-27 23:28:41,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:41,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:28:41,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:41,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:28:41,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:28:41,013 INFO L87 Difference]: Start difference. First operand 1265 states and 2014 transitions. Second operand has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 23:28:41,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:41,326 INFO L93 Difference]: Finished difference Result 1263 states and 2012 transitions. [2024-11-27 23:28:41,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:28:41,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 63 [2024-11-27 23:28:41,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:41,334 INFO L225 Difference]: With dead ends: 1263 [2024-11-27 23:28:41,335 INFO L226 Difference]: Without dead ends: 1263 [2024-11-27 23:28:41,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:28:41,335 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 2 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:41,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 794 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 23:28:41,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2024-11-27 23:28:41,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1263. [2024-11-27 23:28:41,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 941 states have (on average 1.350690754516472) internal successors, (1271), 1018 states have internal predecessors, (1271), 106 states have call successors, (106), 76 states have call predecessors, (106), 118 states have return successors, (635), 168 states have call predecessors, (635), 106 states have call successors, (635) [2024-11-27 23:28:41,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 2012 transitions. [2024-11-27 23:28:41,401 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 2012 transitions. Word has length 63 [2024-11-27 23:28:41,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:41,401 INFO L471 AbstractCegarLoop]: Abstraction has 1263 states and 2012 transitions. [2024-11-27 23:28:41,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 23:28:41,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 2012 transitions. [2024-11-27 23:28:41,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-27 23:28:41,403 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:41,403 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:41,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-27 23:28:41,404 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ASStartErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-27 23:28:41,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:41,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1411772221, now seen corresponding path program 1 times [2024-11-27 23:28:41,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:41,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436952664] [2024-11-27 23:28:41,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:41,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 23:28:41,458 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 23:28:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 23:28:41,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 23:28:41,536 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 23:28:41,537 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ASStartErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (157 of 158 remaining) [2024-11-27 23:28:41,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (156 of 158 remaining) [2024-11-27 23:28:41,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (155 of 158 remaining) [2024-11-27 23:28:41,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (154 of 158 remaining) [2024-11-27 23:28:41,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (153 of 158 remaining) [2024-11-27 23:28:41,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 158 remaining) [2024-11-27 23:28:41,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 158 remaining) [2024-11-27 23:28:41,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 158 remaining) [2024-11-27 23:28:41,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 158 remaining) [2024-11-27 23:28:41,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 158 remaining) [2024-11-27 23:28:41,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 158 remaining) [2024-11-27 23:28:41,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (146 of 158 remaining) [2024-11-27 23:28:41,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (145 of 158 remaining) [2024-11-27 23:28:41,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 158 remaining) [2024-11-27 23:28:41,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (143 of 158 remaining) [2024-11-27 23:28:41,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (142 of 158 remaining) [2024-11-27 23:28:41,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (141 of 158 remaining) [2024-11-27 23:28:41,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 158 remaining) [2024-11-27 23:28:41,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (139 of 158 remaining) [2024-11-27 23:28:41,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (138 of 158 remaining) [2024-11-27 23:28:41,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (137 of 158 remaining) [2024-11-27 23:28:41,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (136 of 158 remaining) [2024-11-27 23:28:41,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 158 remaining) [2024-11-27 23:28:41,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 158 remaining) [2024-11-27 23:28:41,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 158 remaining) [2024-11-27 23:28:41,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 158 remaining) [2024-11-27 23:28:41,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 158 remaining) [2024-11-27 23:28:41,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 158 remaining) [2024-11-27 23:28:41,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 158 remaining) [2024-11-27 23:28:41,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 158 remaining) [2024-11-27 23:28:41,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (127 of 158 remaining) [2024-11-27 23:28:41,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 158 remaining) [2024-11-27 23:28:41,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 158 remaining) [2024-11-27 23:28:41,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (124 of 158 remaining) [2024-11-27 23:28:41,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 158 remaining) [2024-11-27 23:28:41,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 158 remaining) [2024-11-27 23:28:41,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 158 remaining) [2024-11-27 23:28:41,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 158 remaining) [2024-11-27 23:28:41,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (119 of 158 remaining) [2024-11-27 23:28:41,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (118 of 158 remaining) [2024-11-27 23:28:41,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 158 remaining) [2024-11-27 23:28:41,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 158 remaining) [2024-11-27 23:28:41,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 158 remaining) [2024-11-27 23:28:41,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 158 remaining) [2024-11-27 23:28:41,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 158 remaining) [2024-11-27 23:28:41,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 158 remaining) [2024-11-27 23:28:41,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 158 remaining) [2024-11-27 23:28:41,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 158 remaining) [2024-11-27 23:28:41,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 158 remaining) [2024-11-27 23:28:41,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 158 remaining) [2024-11-27 23:28:41,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 158 remaining) [2024-11-27 23:28:41,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 158 remaining) [2024-11-27 23:28:41,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 158 remaining) [2024-11-27 23:28:41,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 158 remaining) [2024-11-27 23:28:41,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 158 remaining) [2024-11-27 23:28:41,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 158 remaining) [2024-11-27 23:28:41,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 158 remaining) [2024-11-27 23:28:41,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 158 remaining) [2024-11-27 23:28:41,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 158 remaining) [2024-11-27 23:28:41,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 158 remaining) [2024-11-27 23:28:41,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 158 remaining) [2024-11-27 23:28:41,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 158 remaining) [2024-11-27 23:28:41,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 158 remaining) [2024-11-27 23:28:41,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 158 remaining) [2024-11-27 23:28:41,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 158 remaining) [2024-11-27 23:28:41,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 158 remaining) [2024-11-27 23:28:41,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 158 remaining) [2024-11-27 23:28:41,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 158 remaining) [2024-11-27 23:28:41,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 158 remaining) [2024-11-27 23:28:41,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 158 remaining) [2024-11-27 23:28:41,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 158 remaining) [2024-11-27 23:28:41,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 158 remaining) [2024-11-27 23:28:41,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 158 remaining) [2024-11-27 23:28:41,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 158 remaining) [2024-11-27 23:28:41,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 158 remaining) [2024-11-27 23:28:41,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 158 remaining) [2024-11-27 23:28:41,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 158 remaining) [2024-11-27 23:28:41,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 158 remaining) [2024-11-27 23:28:41,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 158 remaining) [2024-11-27 23:28:41,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 158 remaining) [2024-11-27 23:28:41,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 158 remaining) [2024-11-27 23:28:41,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 158 remaining) [2024-11-27 23:28:41,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 158 remaining) [2024-11-27 23:28:41,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 158 remaining) [2024-11-27 23:28:41,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 158 remaining) [2024-11-27 23:28:41,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 158 remaining) [2024-11-27 23:28:41,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 158 remaining) [2024-11-27 23:28:41,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 158 remaining) [2024-11-27 23:28:41,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 158 remaining) [2024-11-27 23:28:41,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 158 remaining) [2024-11-27 23:28:41,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 158 remaining) [2024-11-27 23:28:41,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 158 remaining) [2024-11-27 23:28:41,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 158 remaining) [2024-11-27 23:28:41,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 158 remaining) [2024-11-27 23:28:41,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 158 remaining) [2024-11-27 23:28:41,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 158 remaining) [2024-11-27 23:28:41,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 158 remaining) [2024-11-27 23:28:41,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 158 remaining) [2024-11-27 23:28:41,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 158 remaining) [2024-11-27 23:28:41,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 158 remaining) [2024-11-27 23:28:41,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 158 remaining) [2024-11-27 23:28:41,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 158 remaining) [2024-11-27 23:28:41,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 158 remaining) [2024-11-27 23:28:41,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 158 remaining) [2024-11-27 23:28:41,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 158 remaining) [2024-11-27 23:28:41,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 158 remaining) [2024-11-27 23:28:41,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 158 remaining) [2024-11-27 23:28:41,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 158 remaining) [2024-11-27 23:28:41,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 158 remaining) [2024-11-27 23:28:41,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 158 remaining) [2024-11-27 23:28:41,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 158 remaining) [2024-11-27 23:28:41,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 158 remaining) [2024-11-27 23:28:41,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 158 remaining) [2024-11-27 23:28:41,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 158 remaining) [2024-11-27 23:28:41,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 158 remaining) [2024-11-27 23:28:41,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 158 remaining) [2024-11-27 23:28:41,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 158 remaining) [2024-11-27 23:28:41,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 158 remaining) [2024-11-27 23:28:41,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 158 remaining) [2024-11-27 23:28:41,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 158 remaining) [2024-11-27 23:28:41,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 158 remaining) [2024-11-27 23:28:41,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 158 remaining) [2024-11-27 23:28:41,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 158 remaining) [2024-11-27 23:28:41,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 158 remaining) [2024-11-27 23:28:41,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (33 of 158 remaining) [2024-11-27 23:28:41,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (32 of 158 remaining) [2024-11-27 23:28:41,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 158 remaining) [2024-11-27 23:28:41,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 158 remaining) [2024-11-27 23:28:41,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 158 remaining) [2024-11-27 23:28:41,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 158 remaining) [2024-11-27 23:28:41,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 158 remaining) [2024-11-27 23:28:41,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 158 remaining) [2024-11-27 23:28:41,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 158 remaining) [2024-11-27 23:28:41,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 158 remaining) [2024-11-27 23:28:41,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 158 remaining) [2024-11-27 23:28:41,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 158 remaining) [2024-11-27 23:28:41,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 158 remaining) [2024-11-27 23:28:41,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 158 remaining) [2024-11-27 23:28:41,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 158 remaining) [2024-11-27 23:28:41,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 158 remaining) [2024-11-27 23:28:41,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr12ASSERT_VIOLATIONMEMORY_LEAK (17 of 158 remaining) [2024-11-27 23:28:41,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 158 remaining) [2024-11-27 23:28:41,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 158 remaining) [2024-11-27 23:28:41,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 158 remaining) [2024-11-27 23:28:41,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 158 remaining) [2024-11-27 23:28:41,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 158 remaining) [2024-11-27 23:28:41,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 158 remaining) [2024-11-27 23:28:41,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 158 remaining) [2024-11-27 23:28:41,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 158 remaining) [2024-11-27 23:28:41,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 158 remaining) [2024-11-27 23:28:41,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 158 remaining) [2024-11-27 23:28:41,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 158 remaining) [2024-11-27 23:28:41,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 158 remaining) [2024-11-27 23:28:41,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 158 remaining) [2024-11-27 23:28:41,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 158 remaining) [2024-11-27 23:28:41,557 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 158 remaining) [2024-11-27 23:28:41,557 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 158 remaining) [2024-11-27 23:28:41,557 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 158 remaining) [2024-11-27 23:28:41,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-27 23:28:41,561 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:41,617 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 23:28:41,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:28:41 BoogieIcfgContainer [2024-11-27 23:28:41,625 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 23:28:41,626 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 23:28:41,626 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 23:28:41,626 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 23:28:41,627 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:28:12" (3/4) ... [2024-11-27 23:28:41,628 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-27 23:28:41,702 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 16. [2024-11-27 23:28:41,790 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-27 23:28:41,790 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-27 23:28:41,790 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 23:28:41,791 INFO L158 Benchmark]: Toolchain (without parser) took 31447.45ms. Allocated memory was 142.6MB in the beginning and 436.2MB in the end (delta: 293.6MB). Free memory was 115.7MB in the beginning and 312.6MB in the end (delta: -196.8MB). Peak memory consumption was 93.8MB. Max. memory is 16.1GB. [2024-11-27 23:28:41,791 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 72.7MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:28:41,791 INFO L158 Benchmark]: CACSL2BoogieTranslator took 807.55ms. Allocated memory is still 142.6MB. Free memory was 115.5MB in the beginning and 90.1MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-27 23:28:41,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.91ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 87.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:28:41,792 INFO L158 Benchmark]: Boogie Preprocessor took 80.05ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 83.1MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 23:28:41,793 INFO L158 Benchmark]: RCFGBuilder took 1499.03ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 91.3MB in the end (delta: -8.2MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2024-11-27 23:28:41,793 INFO L158 Benchmark]: TraceAbstraction took 28801.22ms. Allocated memory was 142.6MB in the beginning and 436.2MB in the end (delta: 293.6MB). Free memory was 90.5MB in the beginning and 316.7MB in the end (delta: -226.2MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. [2024-11-27 23:28:41,794 INFO L158 Benchmark]: Witness Printer took 164.77ms. Allocated memory is still 436.2MB. Free memory was 316.7MB in the beginning and 312.6MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:28:41,798 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 72.7MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 807.55ms. Allocated memory is still 142.6MB. Free memory was 115.5MB in the beginning and 90.1MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.91ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 87.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 80.05ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 83.1MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1499.03ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 91.3MB in the end (delta: -8.2MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. * TraceAbstraction took 28801.22ms. Allocated memory was 142.6MB in the beginning and 436.2MB in the end (delta: 293.6MB). Free memory was 90.5MB in the beginning and 316.7MB in the end (delta: -226.2MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. * Witness Printer took 164.77ms. Allocated memory is still 436.2MB. Free memory was 316.7MB in the beginning and 312.6MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L779] user_t *user; VAL [user={0:0}] [L975] user = malloc(sizeof(user_t)) [L976] CALL user_initialize() [L966] EXPR, FCALL calloc(1, sizeof(info_t)) VAL [user={-1:0}] [L966] user->info = calloc(1, sizeof(info_t)) VAL [user={-1:0}] [L967] user->message.id = 11 VAL [user={-1:0}] [L968] EXPR user->info VAL [user={-1:0}] [L968] user->info->is_valid = 0 VAL [user={-1:0}] [L969] user->status = AS_NULL VAL [user={-1:0}] [L970] user->user_id = 11 VAL [user={-1:0}] [L971] user->timeout = 3 VAL [user={-1:0}] [L976] RET user_initialize() [L977] event_t e = {0}; [L977] event_t e = {0}; [L977] event_t e = {0}; [L977] event_t e = {0}; VAL [user={-1:0}] [L978] e.primitive = _EVENT_START VAL [user={-1:0}] [L979] CALL event_precess(&e) VAL [\old(e)={10:0}, user={-1:0}] [L943] EXPR user->status VAL [\old(e)={10:0}, e={10:0}, user={-1:0}] [L943] sys_state_t status = user->status; [L944] int rc = -1; VAL [\old(e)={10:0}, e={10:0}, rc=-1, status=1, user={-1:0}] [L945] COND TRUE status < AS_STATE_MAX [L947] case AS_NULL: VAL [\old(e)={10:0}, e={10:0}, rc=-1, status=1, user={-1:0}] [L948] CALL ASNull(e) VAL [\old(e)={10:0}, user={-1:0}] [L838] EXPR e->primitive VAL [\old(e)={10:0}, user={-1:0}] [L838] e_primitive_t primitive = e->primitive; [L839] COND TRUE primitive == _EVENT_START VAL [\old(e)={10:0}, user={-1:0}] [L840] CALL status_update(AS_START) VAL [\old(status)=2, user={-1:0}] [L814] COND TRUE status < AS_STATE_MAX VAL [\old(status)=2, status=2, user={-1:0}] [L815] EXPR user->status VAL [\old(status)=2, status=2, user={-1:0}] [L815] COND TRUE user->status != status [L816] user->status = status VAL [\old(status)=2, user={-1:0}] [L817] return 10; VAL [\old(status)=2, \result=10, user={-1:0}] [L840] RET status_update(AS_START) VAL [\old(e)={10:0}, user={-1:0}] [L841] CALL system_initialize() VAL [user={-1:0}] [L829] event_t e = {0}; [L829] event_t e = {0}; [L829] event_t e = {0}; [L829] event_t e = {0}; VAL [e={9:0}, user={-1:0}] [L830] EXPR user->info VAL [e={9:0}, user={-1:0}] [L830] EXPR user->info->is_valid VAL [e={9:0}, user={-1:0}] [L830] COND TRUE !user->info->is_valid [L831] e.primitive = _EVENT_CLOSE VAL [e={9:0}, user={-1:0}] [L835] CALL event_precess(&e) VAL [\old(e)={9:0}, user={-1:0}] [L943] EXPR user->status VAL [\old(e)={9:0}, e={9:0}, user={-1:0}] [L943] sys_state_t status = user->status; [L944] int rc = -1; VAL [\old(e)={9:0}, e={9:0}, rc=-1, status=2, user={-1:0}] [L945] COND TRUE status < AS_STATE_MAX [L947] case AS_NULL: [L950] case AS_START: VAL [\old(e)={9:0}, e={9:0}, rc=-1, status=2, user={-1:0}] [L951] CALL ASStart(e) VAL [\old(e)={9:0}, user={-1:0}] [L881] EXPR e->primitive VAL [\old(e)={9:0}, e={9:0}, user={-1:0}] [L881] e_primitive_t primitive = e->primitive; [L882] int rc = -1; [L884] case _EVENT_OPEN: VAL [\old(e)={9:0}, e={9:0}, primitive=3, rc=-1, user={-1:0}] [L884] case _EVENT_OPEN: [L898] case _EVENT_CLOSE: VAL [\old(e)={9:0}, e={9:0}, rc=-1, user={-1:0}] [L898] case _EVENT_CLOSE: [L899] message_t *message = &user->message; [L900] EXPR, FCALL calloc(0, sizeof(*message)) VAL [\old(e)={9:0}, e={9:0}, rc=-1, user={-1:0}] [L900] message = calloc(0, sizeof(*message)) [L901] message->id = 3 - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 973]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 387 locations, 158 error locations. Started 1 CEGAR loops. OverallTime: 28.7s, OverallIterations: 26, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5150 SdHoareTripleChecker+Valid, 13.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5120 mSDsluCounter, 32719 SdHoareTripleChecker+Invalid, 11.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23880 mSDsCounter, 1144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11846 IncrementalHoareTripleChecker+Invalid, 12990 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1144 mSolverCounterUnsat, 8839 mSDtfsCounter, 11846 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 177 SyntacticMatches, 6 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1284occurred in iteration=23, InterpolantAutomatonStates: 187, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 25 MinimizatonAttempts, 808 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 1099 NumberOfCodeBlocks, 1099 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1009 ConstructedInterpolants, 0 QuantifiedInterpolants, 5566 SizeOfPredicates, 20 NumberOfNonLiveVariables, 971 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 27 InterpolantComputations, 25 PerfectInterpolantSequences, 67/71 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-27 23:28:41,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae5397db-ce89-4d1c-9291-e2a92fd3df67/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)