./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr-deref.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_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/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_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr-deref.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/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_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/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 12bbf3623faa1d8cb0ae406b9406d293839854c20d2fb62622ec841c419248fb --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:53:22,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:53:22,838 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 02:53:22,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:53:22,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:53:22,870 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:53:22,871 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:53:22,871 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:53:22,872 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:53:22,872 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:53:22,872 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:53:22,872 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:53:22,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:53:22,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:53:22,873 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:53:22,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:53:22,873 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:53:22,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:53:22,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:53:22,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:53:22,874 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 02:53:22,874 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 02:53:22,874 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 02:53:22,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:53:22,874 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 02:53:22,874 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 02:53:22,875 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:53:22,875 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:53:22,875 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:53:22,875 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:53:22,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:53:22,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:53:22,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:53:22,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:53:22,876 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:53:22,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:53:22,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:53:22,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:53:22,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:53:22,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:53:22,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:53:22,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:53:22,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:53:22,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:53:22,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:53:22,878 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:53:22,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:53:22,878 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_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/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 -> 12bbf3623faa1d8cb0ae406b9406d293839854c20d2fb62622ec841c419248fb [2024-11-28 02:53:23,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:53:23,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:53:23,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:53:23,211 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:53:23,212 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:53:23,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr-deref.i [2024-11-28 02:53:26,309 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/data/0e4f10f24/d87ebdd3d18b416ea8bf5b853565417f/FLAG395e46344 [2024-11-28 02:53:26,746 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:53:26,747 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr-deref.i [2024-11-28 02:53:26,770 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/data/0e4f10f24/d87ebdd3d18b416ea8bf5b853565417f/FLAG395e46344 [2024-11-28 02:53:26,785 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/data/0e4f10f24/d87ebdd3d18b416ea8bf5b853565417f [2024-11-28 02:53:26,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:53:26,790 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:53:26,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:53:26,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:53:26,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:53:26,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:53:26" (1/1) ... [2024-11-28 02:53:26,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40a7fcb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:26, skipping insertion in model container [2024-11-28 02:53:26,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:53:26" (1/1) ... [2024-11-28 02:53:26,844 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:53:27,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:53:27,509 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:53:27,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:53:27,689 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:53:27,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27 WrapperNode [2024-11-28 02:53:27,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:53:27,693 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:53:27,693 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:53:27,693 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:53:27,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27" (1/1) ... [2024-11-28 02:53:27,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27" (1/1) ... [2024-11-28 02:53:27,786 INFO L138 Inliner]: procedures = 372, calls = 87, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 176 [2024-11-28 02:53:27,786 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:53:27,787 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:53:27,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:53:27,787 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:53:27,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27" (1/1) ... [2024-11-28 02:53:27,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27" (1/1) ... [2024-11-28 02:53:27,812 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27" (1/1) ... [2024-11-28 02:53:27,841 INFO L175 MemorySlicer]: Split 78 memory accesses to 2 slices as follows [64, 14]. 82 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [60, 0]. The 11 writes are split as follows [1, 10]. [2024-11-28 02:53:27,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27" (1/1) ... [2024-11-28 02:53:27,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27" (1/1) ... [2024-11-28 02:53:27,854 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27" (1/1) ... [2024-11-28 02:53:27,856 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27" (1/1) ... [2024-11-28 02:53:27,859 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27" (1/1) ... [2024-11-28 02:53:27,862 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27" (1/1) ... [2024-11-28 02:53:27,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27" (1/1) ... [2024-11-28 02:53:27,867 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:53:27,868 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:53:27,868 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:53:27,868 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:53:27,869 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27" (1/1) ... [2024-11-28 02:53:27,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:53:27,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:53:27,913 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:53:27,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:53:27,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 02:53:27,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 02:53:27,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-28 02:53:27,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-28 02:53:27,953 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-28 02:53:27,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 02:53:27,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 02:53:27,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 02:53:27,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 02:53:27,953 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-28 02:53:27,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 02:53:27,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:53:27,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 02:53:27,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 02:53:27,954 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-28 02:53:27,954 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-28 02:53:27,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:53:27,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 02:53:27,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:53:27,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:53:27,957 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 02:53:28,162 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:53:28,163 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:53:28,826 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 02:53:28,826 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:53:29,457 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:53:29,458 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-28 02:53:29,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:53:29 BoogieIcfgContainer [2024-11-28 02:53:29,458 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:53:29,462 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:53:29,462 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:53:29,469 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:53:29,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:53:26" (1/3) ... [2024-11-28 02:53:29,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1594e1e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:53:29, skipping insertion in model container [2024-11-28 02:53:29,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27" (2/3) ... [2024-11-28 02:53:29,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1594e1e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:53:29, skipping insertion in model container [2024-11-28 02:53:29,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:53:29" (3/3) ... [2024-11-28 02:53:29,474 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_19-nested_nr-deref.i [2024-11-28 02:53:29,491 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:53:29,493 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_19-nested_nr-deref.i that has 2 procedures, 71 locations, 1 initial locations, 1 loop locations, and 37 error locations. [2024-11-28 02:53:29,493 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 02:53:29,591 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-28 02:53:29,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 71 transitions, 146 flow [2024-11-28 02:53:29,701 INFO L124 PetriNetUnfolderBase]: 1/70 cut-off events. [2024-11-28 02:53:29,704 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 02:53:29,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 70 events. 1/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 163 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2024-11-28 02:53:29,710 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 71 transitions, 146 flow [2024-11-28 02:53:29,714 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 70 transitions, 143 flow [2024-11-28 02:53:29,735 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:53:29,754 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;@798a7e7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:53:29,756 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-28 02:53:29,765 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 02:53:29,765 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-28 02:53:29,765 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 02:53:29,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:53:29,766 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-28 02:53:29,766 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:53:29,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:29,773 INFO L85 PathProgramCache]: Analyzing trace with hash 499847, now seen corresponding path program 1 times [2024-11-28 02:53:29,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:29,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29123985] [2024-11-28 02:53:29,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:29,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:30,207 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-28 02:53:30,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:30,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29123985] [2024-11-28 02:53:30,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29123985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:30,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:30,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:53:30,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162080528] [2024-11-28 02:53:30,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:30,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:53:30,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:30,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:53:30,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:53:30,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2024-11-28 02:53:30,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:30,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:53:30,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2024-11-28 02:53:30,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:53:30,498 INFO L124 PetriNetUnfolderBase]: 64/267 cut-off events. [2024-11-28 02:53:30,499 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 02:53:30,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 267 events. 64/267 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1224 event pairs, 63 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 377. Up to 153 conditions per place. [2024-11-28 02:53:30,507 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 25 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-11-28 02:53:30,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 71 transitions, 199 flow [2024-11-28 02:53:30,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:53:30,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:53:30,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2024-11-28 02:53:30,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7652582159624414 [2024-11-28 02:53:30,529 INFO L175 Difference]: Start difference. First operand has 73 places, 70 transitions, 143 flow. Second operand 3 states and 163 transitions. [2024-11-28 02:53:30,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 71 transitions, 199 flow [2024-11-28 02:53:30,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 71 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 02:53:30,544 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 154 flow [2024-11-28 02:53:30,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2024-11-28 02:53:30,552 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 2 predicate places. [2024-11-28 02:53:30,554 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 154 flow [2024-11-28 02:53:30,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:30,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:53:30,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-28 02:53:30,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:53:30,557 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:53:30,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:30,558 INFO L85 PathProgramCache]: Analyzing trace with hash 15494331, now seen corresponding path program 1 times [2024-11-28 02:53:30,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:30,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98179931] [2024-11-28 02:53:30,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:30,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:30,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:53:30,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:30,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98179931] [2024-11-28 02:53:30,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98179931] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:53:30,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032308084] [2024-11-28 02:53:30,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:30,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:53:30,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:53:30,775 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:53:30,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:53:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:30,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 02:53:30,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:53:30,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:53:30,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:53:31,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:53:31,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032308084] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:53:31,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:53:31,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-28 02:53:31,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033761549] [2024-11-28 02:53:31,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:53:31,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:53:31,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:31,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:53:31,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:53:31,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2024-11-28 02:53:31,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 154 flow. Second operand has 7 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:31,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:53:31,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2024-11-28 02:53:31,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:53:31,203 INFO L124 PetriNetUnfolderBase]: 64/270 cut-off events. [2024-11-28 02:53:31,204 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 02:53:31,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 270 events. 64/270 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1224 event pairs, 63 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 429. Up to 153 conditions per place. [2024-11-28 02:53:31,212 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 25 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2024-11-28 02:53:31,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 226 flow [2024-11-28 02:53:31,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:53:31,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 02:53:31,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 303 transitions. [2024-11-28 02:53:31,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7112676056338029 [2024-11-28 02:53:31,216 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 154 flow. Second operand 6 states and 303 transitions. [2024-11-28 02:53:31,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 226 flow [2024-11-28 02:53:31,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 74 transitions, 222 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-28 02:53:31,222 INFO L231 Difference]: Finished difference. Result has 82 places, 74 transitions, 186 flow [2024-11-28 02:53:31,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=82, PETRI_TRANSITIONS=74} [2024-11-28 02:53:31,224 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 9 predicate places. [2024-11-28 02:53:31,225 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 74 transitions, 186 flow [2024-11-28 02:53:31,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:31,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:53:31,226 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2024-11-28 02:53:31,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 02:53:31,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:53:31,427 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:53:31,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:31,428 INFO L85 PathProgramCache]: Analyzing trace with hash 2029163848, now seen corresponding path program 2 times [2024-11-28 02:53:31,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:31,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500010065] [2024-11-28 02:53:31,429 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:53:31,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:31,488 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 02:53:31,492 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:53:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 02:53:31,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:31,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500010065] [2024-11-28 02:53:31,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500010065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:31,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:31,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:53:31,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864907210] [2024-11-28 02:53:31,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:31,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:53:31,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:31,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:53:31,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:53:31,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 71 [2024-11-28 02:53:31,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 74 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:31,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:53:31,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 71 [2024-11-28 02:53:31,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:53:31,956 INFO L124 PetriNetUnfolderBase]: 64/266 cut-off events. [2024-11-28 02:53:31,956 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-28 02:53:31,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 266 events. 64/266 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1201 event pairs, 63 based on Foata normal form. 2/211 useless extension candidates. Maximal degree in co-relation 416. Up to 155 conditions per place. [2024-11-28 02:53:31,958 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 26 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2024-11-28 02:53:31,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 70 transitions, 238 flow [2024-11-28 02:53:31,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:53:31,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:53:31,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2024-11-28 02:53:31,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7183098591549296 [2024-11-28 02:53:31,966 INFO L175 Difference]: Start difference. First operand has 82 places, 74 transitions, 186 flow. Second operand 3 states and 153 transitions. [2024-11-28 02:53:31,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 70 transitions, 238 flow [2024-11-28 02:53:31,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 70 transitions, 224 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-28 02:53:31,970 INFO L231 Difference]: Finished difference. Result has 79 places, 70 transitions, 172 flow [2024-11-28 02:53:31,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=79, PETRI_TRANSITIONS=70} [2024-11-28 02:53:31,972 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 6 predicate places. [2024-11-28 02:53:31,973 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 70 transitions, 172 flow [2024-11-28 02:53:31,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:31,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:53:31,973 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2024-11-28 02:53:31,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:53:31,974 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:53:31,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:31,976 INFO L85 PathProgramCache]: Analyzing trace with hash 2029163847, now seen corresponding path program 1 times [2024-11-28 02:53:31,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:31,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542750732] [2024-11-28 02:53:31,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:31,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:32,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 02:53:32,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:32,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542750732] [2024-11-28 02:53:32,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542750732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:32,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:32,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:53:32,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328028209] [2024-11-28 02:53:32,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:32,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:53:32,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:32,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:53:32,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:53:32,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 71 [2024-11-28 02:53:32,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 70 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:32,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:53:32,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 71 [2024-11-28 02:53:32,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:53:32,416 INFO L124 PetriNetUnfolderBase]: 64/262 cut-off events. [2024-11-28 02:53:32,416 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-28 02:53:32,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 262 events. 64/262 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1198 event pairs, 63 based on Foata normal form. 2/209 useless extension candidates. Maximal degree in co-relation 418. Up to 155 conditions per place. [2024-11-28 02:53:32,419 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 28 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2024-11-28 02:53:32,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 66 transitions, 228 flow [2024-11-28 02:53:32,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:53:32,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:53:32,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2024-11-28 02:53:32,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6995305164319249 [2024-11-28 02:53:32,423 INFO L175 Difference]: Start difference. First operand has 79 places, 70 transitions, 172 flow. Second operand 3 states and 149 transitions. [2024-11-28 02:53:32,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 66 transitions, 228 flow [2024-11-28 02:53:32,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 66 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 02:53:32,428 INFO L231 Difference]: Finished difference. Result has 75 places, 66 transitions, 164 flow [2024-11-28 02:53:32,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=75, PETRI_TRANSITIONS=66} [2024-11-28 02:53:32,430 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 2 predicate places. [2024-11-28 02:53:32,430 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 66 transitions, 164 flow [2024-11-28 02:53:32,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:32,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:53:32,430 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2024-11-28 02:53:32,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 02:53:32,431 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:53:32,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:32,432 INFO L85 PathProgramCache]: Analyzing trace with hash 111318959, now seen corresponding path program 1 times [2024-11-28 02:53:32,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:32,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080320742] [2024-11-28 02:53:32,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:32,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:32,673 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:53:32,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:32,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080320742] [2024-11-28 02:53:32,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080320742] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:53:32,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299309957] [2024-11-28 02:53:32,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:32,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:53:32,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:53:32,679 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:53:32,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:53:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:32,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 02:53:32,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:53:32,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:53:32,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:53:32,991 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:53:32,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299309957] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:53:32,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:53:32,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-28 02:53:32,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060292709] [2024-11-28 02:53:32,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:53:32,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 02:53:32,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:32,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 02:53:32,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-28 02:53:32,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2024-11-28 02:53:33,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 66 transitions, 164 flow. Second operand has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:33,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:53:33,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2024-11-28 02:53:33,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:53:33,222 INFO L124 PetriNetUnfolderBase]: 64/268 cut-off events. [2024-11-28 02:53:33,222 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-28 02:53:33,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 268 events. 64/268 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1198 event pairs, 63 based on Foata normal form. 6/219 useless extension candidates. Maximal degree in co-relation 416. Up to 153 conditions per place. [2024-11-28 02:53:33,226 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 25 selfloop transitions, 11 changer transitions 0/72 dead transitions. [2024-11-28 02:53:33,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 72 transitions, 272 flow [2024-11-28 02:53:33,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:53:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-28 02:53:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 582 transitions. [2024-11-28 02:53:33,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6830985915492958 [2024-11-28 02:53:33,230 INFO L175 Difference]: Start difference. First operand has 75 places, 66 transitions, 164 flow. Second operand 12 states and 582 transitions. [2024-11-28 02:53:33,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 72 transitions, 272 flow [2024-11-28 02:53:33,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 72 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 02:53:33,233 INFO L231 Difference]: Finished difference. Result has 90 places, 72 transitions, 240 flow [2024-11-28 02:53:33,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=240, PETRI_PLACES=90, PETRI_TRANSITIONS=72} [2024-11-28 02:53:33,237 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 17 predicate places. [2024-11-28 02:53:33,237 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 72 transitions, 240 flow [2024-11-28 02:53:33,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:33,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:53:33,238 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2024-11-28 02:53:33,251 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 02:53:33,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:53:33,439 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:53:33,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:33,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1105201871, now seen corresponding path program 2 times [2024-11-28 02:53:33,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:33,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349770870] [2024-11-28 02:53:33,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:53:33,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:33,466 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 02:53:33,467 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:53:33,687 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-28 02:53:33,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:33,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349770870] [2024-11-28 02:53:33,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349770870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:33,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:33,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:53:33,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586624703] [2024-11-28 02:53:33,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:33,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:53:33,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:33,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:53:33,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:53:33,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 71 [2024-11-28 02:53:33,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 72 transitions, 240 flow. Second operand has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:33,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:53:33,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 71 [2024-11-28 02:53:33,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:53:34,134 INFO L124 PetriNetUnfolderBase]: 73/286 cut-off events. [2024-11-28 02:53:34,135 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-28 02:53:34,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 286 events. 73/286 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1287 event pairs, 72 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 457. Up to 183 conditions per place. [2024-11-28 02:53:34,138 INFO L140 encePairwiseOnDemand]: 66/71 looper letters, 38 selfloop transitions, 1 changer transitions 0/68 dead transitions. [2024-11-28 02:53:34,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 68 transitions, 310 flow [2024-11-28 02:53:34,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:53:34,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:53:34,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2024-11-28 02:53:34,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6901408450704225 [2024-11-28 02:53:34,140 INFO L175 Difference]: Start difference. First operand has 90 places, 72 transitions, 240 flow. Second operand 3 states and 147 transitions. [2024-11-28 02:53:34,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 68 transitions, 310 flow [2024-11-28 02:53:34,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 68 transitions, 262 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-11-28 02:53:34,148 INFO L231 Difference]: Finished difference. Result has 83 places, 68 transitions, 186 flow [2024-11-28 02:53:34,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=83, PETRI_TRANSITIONS=68} [2024-11-28 02:53:34,152 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 10 predicate places. [2024-11-28 02:53:34,152 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 68 transitions, 186 flow [2024-11-28 02:53:34,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:34,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:53:34,153 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2024-11-28 02:53:34,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 02:53:34,153 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:53:34,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:34,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1105201872, now seen corresponding path program 1 times [2024-11-28 02:53:34,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:34,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990773213] [2024-11-28 02:53:34,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:34,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:34,573 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-28 02:53:34,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:34,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990773213] [2024-11-28 02:53:34,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990773213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:34,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:34,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:53:34,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857978754] [2024-11-28 02:53:34,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:34,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:53:34,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:34,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:53:34,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:53:34,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 71 [2024-11-28 02:53:34,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 68 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:34,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:53:34,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 71 [2024-11-28 02:53:34,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:53:35,108 INFO L124 PetriNetUnfolderBase]: 64/254 cut-off events. [2024-11-28 02:53:35,109 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-11-28 02:53:35,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 254 events. 64/254 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1111 event pairs, 54 based on Foata normal form. 9/220 useless extension candidates. Maximal degree in co-relation 438. Up to 129 conditions per place. [2024-11-28 02:53:35,111 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 36 selfloop transitions, 6 changer transitions 3/74 dead transitions. [2024-11-28 02:53:35,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 74 transitions, 288 flow [2024-11-28 02:53:35,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:53:35,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 02:53:35,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 228 transitions. [2024-11-28 02:53:35,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6422535211267606 [2024-11-28 02:53:35,115 INFO L175 Difference]: Start difference. First operand has 83 places, 68 transitions, 186 flow. Second operand 5 states and 228 transitions. [2024-11-28 02:53:35,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 74 transitions, 288 flow [2024-11-28 02:53:35,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 74 transitions, 287 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 02:53:35,121 INFO L231 Difference]: Finished difference. Result has 83 places, 65 transitions, 191 flow [2024-11-28 02:53:35,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=83, PETRI_TRANSITIONS=65} [2024-11-28 02:53:35,124 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 10 predicate places. [2024-11-28 02:53:35,124 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 191 flow [2024-11-28 02:53:35,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:35,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:53:35,125 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:35,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 02:53:35,129 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:53:35,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:35,129 INFO L85 PathProgramCache]: Analyzing trace with hash -348817336, now seen corresponding path program 1 times [2024-11-28 02:53:35,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:35,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815482635] [2024-11-28 02:53:35,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:35,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:35,686 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-28 02:53:35,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:35,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815482635] [2024-11-28 02:53:35,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815482635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:35,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:35,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:53:35,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119606644] [2024-11-28 02:53:35,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:35,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:53:35,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:35,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:53:35,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:53:36,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 71 [2024-11-28 02:53:36,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 65 transitions, 191 flow. Second operand has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 7 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:36,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:53:36,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 71 [2024-11-28 02:53:36,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:53:36,319 INFO L124 PetriNetUnfolderBase]: 64/252 cut-off events. [2024-11-28 02:53:36,319 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-28 02:53:36,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 252 events. 64/252 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1100 event pairs, 54 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 453. Up to 126 conditions per place. [2024-11-28 02:53:36,321 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 38 selfloop transitions, 7 changer transitions 3/72 dead transitions. [2024-11-28 02:53:36,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 72 transitions, 301 flow [2024-11-28 02:53:36,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:53:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 02:53:36,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 292 transitions. [2024-11-28 02:53:36,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5875251509054326 [2024-11-28 02:53:36,323 INFO L175 Difference]: Start difference. First operand has 83 places, 65 transitions, 191 flow. Second operand 7 states and 292 transitions. [2024-11-28 02:53:36,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 72 transitions, 301 flow [2024-11-28 02:53:36,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 72 transitions, 289 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-28 02:53:36,327 INFO L231 Difference]: Finished difference. Result has 83 places, 63 transitions, 189 flow [2024-11-28 02:53:36,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=189, PETRI_PLACES=83, PETRI_TRANSITIONS=63} [2024-11-28 02:53:36,328 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 10 predicate places. [2024-11-28 02:53:36,328 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 63 transitions, 189 flow [2024-11-28 02:53:36,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 7 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:36,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:53:36,328 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:36,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 02:53:36,328 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:53:36,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:36,329 INFO L85 PathProgramCache]: Analyzing trace with hash -348817335, now seen corresponding path program 1 times [2024-11-28 02:53:36,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:36,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314844687] [2024-11-28 02:53:36,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:36,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:37,060 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-28 02:53:37,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:37,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314844687] [2024-11-28 02:53:37,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314844687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:37,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:37,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:53:37,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906580760] [2024-11-28 02:53:37,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:37,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:53:37,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:37,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:53:37,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:53:37,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 71 [2024-11-28 02:53:37,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 63 transitions, 189 flow. Second operand has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:37,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:53:37,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 71 [2024-11-28 02:53:37,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:53:37,879 INFO L124 PetriNetUnfolderBase]: 64/250 cut-off events. [2024-11-28 02:53:37,879 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-11-28 02:53:37,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 250 events. 64/250 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1094 event pairs, 54 based on Foata normal form. 1/211 useless extension candidates. Maximal degree in co-relation 452. Up to 126 conditions per place. [2024-11-28 02:53:37,882 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 37 selfloop transitions, 7 changer transitions 3/70 dead transitions. [2024-11-28 02:53:37,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 70 transitions, 297 flow [2024-11-28 02:53:37,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:53:37,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 02:53:37,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 270 transitions. [2024-11-28 02:53:37,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5432595573440644 [2024-11-28 02:53:37,887 INFO L175 Difference]: Start difference. First operand has 83 places, 63 transitions, 189 flow. Second operand 7 states and 270 transitions. [2024-11-28 02:53:37,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 70 transitions, 297 flow [2024-11-28 02:53:37,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 70 transitions, 283 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-28 02:53:37,890 INFO L231 Difference]: Finished difference. Result has 81 places, 61 transitions, 185 flow [2024-11-28 02:53:37,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=185, PETRI_PLACES=81, PETRI_TRANSITIONS=61} [2024-11-28 02:53:37,891 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 8 predicate places. [2024-11-28 02:53:37,892 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 61 transitions, 185 flow [2024-11-28 02:53:37,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:37,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:53:37,892 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:37,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 02:53:37,893 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:53:37,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:37,893 INFO L85 PathProgramCache]: Analyzing trace with hash -205992541, now seen corresponding path program 1 times [2024-11-28 02:53:37,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:37,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933191687] [2024-11-28 02:53:37,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:37,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:38,275 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-28 02:53:38,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:38,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933191687] [2024-11-28 02:53:38,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933191687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:38,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:38,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:53:38,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75581971] [2024-11-28 02:53:38,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:38,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:53:38,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:38,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:53:38,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:53:38,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 71 [2024-11-28 02:53:38,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 61 transitions, 185 flow. Second operand has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:38,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:53:38,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 71 [2024-11-28 02:53:38,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:53:38,679 INFO L124 PetriNetUnfolderBase]: 64/249 cut-off events. [2024-11-28 02:53:38,679 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2024-11-28 02:53:38,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 249 events. 64/249 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1094 event pairs, 63 based on Foata normal form. 1/211 useless extension candidates. Maximal degree in co-relation 449. Up to 158 conditions per place. [2024-11-28 02:53:38,681 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 30 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2024-11-28 02:53:38,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 60 transitions, 255 flow [2024-11-28 02:53:38,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:53:38,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 02:53:38,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 227 transitions. [2024-11-28 02:53:38,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6394366197183099 [2024-11-28 02:53:38,683 INFO L175 Difference]: Start difference. First operand has 81 places, 61 transitions, 185 flow. Second operand 5 states and 227 transitions. [2024-11-28 02:53:38,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 60 transitions, 255 flow [2024-11-28 02:53:38,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 60 transitions, 241 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-28 02:53:38,686 INFO L231 Difference]: Finished difference. Result has 78 places, 60 transitions, 181 flow [2024-11-28 02:53:38,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=78, PETRI_TRANSITIONS=60} [2024-11-28 02:53:38,687 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 5 predicate places. [2024-11-28 02:53:38,687 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 60 transitions, 181 flow [2024-11-28 02:53:38,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:38,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:53:38,687 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:38,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 02:53:38,688 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:53:38,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:38,689 INFO L85 PathProgramCache]: Analyzing trace with hash -205992542, now seen corresponding path program 1 times [2024-11-28 02:53:38,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:38,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280660480] [2024-11-28 02:53:38,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:38,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:38,843 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-28 02:53:38,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:38,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280660480] [2024-11-28 02:53:38,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280660480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:38,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:38,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:53:38,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697615543] [2024-11-28 02:53:38,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:38,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:53:38,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:38,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:53:38,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:53:39,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 71 [2024-11-28 02:53:39,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 60 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:39,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:53:39,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 71 [2024-11-28 02:53:39,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:53:39,238 INFO L124 PetriNetUnfolderBase]: 64/248 cut-off events. [2024-11-28 02:53:39,238 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-11-28 02:53:39,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 248 events. 64/248 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1089 event pairs, 63 based on Foata normal form. 1/210 useless extension candidates. Maximal degree in co-relation 440. Up to 158 conditions per place. [2024-11-28 02:53:39,241 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 32 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2024-11-28 02:53:39,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 59 transitions, 255 flow [2024-11-28 02:53:39,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:53:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 02:53:39,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 219 transitions. [2024-11-28 02:53:39,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6169014084507042 [2024-11-28 02:53:39,243 INFO L175 Difference]: Start difference. First operand has 78 places, 60 transitions, 181 flow. Second operand 5 states and 219 transitions. [2024-11-28 02:53:39,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 59 transitions, 255 flow [2024-11-28 02:53:39,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 59 transitions, 243 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-28 02:53:39,246 INFO L231 Difference]: Finished difference. Result has 77 places, 59 transitions, 179 flow [2024-11-28 02:53:39,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=77, PETRI_TRANSITIONS=59} [2024-11-28 02:53:39,246 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 4 predicate places. [2024-11-28 02:53:39,247 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 59 transitions, 179 flow [2024-11-28 02:53:39,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:39,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:53:39,247 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:39,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 02:53:39,248 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:53:39,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:39,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1484762880, now seen corresponding path program 1 times [2024-11-28 02:53:39,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:39,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719212916] [2024-11-28 02:53:39,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:39,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:39,440 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-28 02:53:39,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:39,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719212916] [2024-11-28 02:53:39,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719212916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:39,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:39,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:53:39,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254756520] [2024-11-28 02:53:39,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:39,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:53:39,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:39,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:53:39,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:53:39,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 71 [2024-11-28 02:53:39,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 59 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:39,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:53:39,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 71 [2024-11-28 02:53:39,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:53:39,657 INFO L124 PetriNetUnfolderBase]: 64/251 cut-off events. [2024-11-28 02:53:39,657 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-11-28 02:53:39,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 251 events. 64/251 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1091 event pairs, 56 based on Foata normal form. 8/225 useless extension candidates. Maximal degree in co-relation 441. Up to 148 conditions per place. [2024-11-28 02:53:39,659 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 41 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-11-28 02:53:39,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 64 transitions, 275 flow [2024-11-28 02:53:39,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:53:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:53:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2024-11-28 02:53:39,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7699530516431925 [2024-11-28 02:53:39,661 INFO L175 Difference]: Start difference. First operand has 77 places, 59 transitions, 179 flow. Second operand 3 states and 164 transitions. [2024-11-28 02:53:39,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 64 transitions, 275 flow [2024-11-28 02:53:39,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 64 transitions, 263 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-28 02:53:39,664 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 167 flow [2024-11-28 02:53:39,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2024-11-28 02:53:39,665 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2024-11-28 02:53:39,665 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 167 flow [2024-11-28 02:53:39,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:39,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:53:39,665 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:39,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 02:53:39,666 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:53:39,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:39,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1484762881, now seen corresponding path program 1 times [2024-11-28 02:53:39,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:39,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251853100] [2024-11-28 02:53:39,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:39,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:39,794 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-28 02:53:39,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:39,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251853100] [2024-11-28 02:53:39,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251853100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:39,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:39,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:53:39,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422615828] [2024-11-28 02:53:39,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:39,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:53:39,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:39,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:53:39,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:53:39,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 71 [2024-11-28 02:53:39,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:39,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:53:39,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 71 [2024-11-28 02:53:39,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:53:40,000 INFO L124 PetriNetUnfolderBase]: 71/242 cut-off events. [2024-11-28 02:53:40,000 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-11-28 02:53:40,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 242 events. 71/242 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 994 event pairs, 56 based on Foata normal form. 8/223 useless extension candidates. Maximal degree in co-relation 457. Up to 148 conditions per place. [2024-11-28 02:53:40,002 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 42 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2024-11-28 02:53:40,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 62 transitions, 265 flow [2024-11-28 02:53:40,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:53:40,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:53:40,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2024-11-28 02:53:40,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7605633802816901 [2024-11-28 02:53:40,004 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 167 flow. Second operand 3 states and 162 transitions. [2024-11-28 02:53:40,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 62 transitions, 265 flow [2024-11-28 02:53:40,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 62 transitions, 261 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 02:53:40,007 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 163 flow [2024-11-28 02:53:40,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2024-11-28 02:53:40,008 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -2 predicate places. [2024-11-28 02:53:40,008 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 163 flow [2024-11-28 02:53:40,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:40,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:53:40,009 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:40,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 02:53:40,009 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:53:40,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:40,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1207322128, now seen corresponding path program 1 times [2024-11-28 02:53:40,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:40,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936575574] [2024-11-28 02:53:40,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:40,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:40,607 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-28 02:53:40,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:40,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936575574] [2024-11-28 02:53:40,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936575574] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:53:40,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119170539] [2024-11-28 02:53:40,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:40,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:53:40,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:53:40,611 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:53:40,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 02:53:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:40,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-28 02:53:40,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:53:40,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-28 02:53:41,022 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 35 treesize of output 19 [2024-11-28 02:53:41,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2024-11-28 02:53:41,058 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-28 02:53:41,058 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:53:41,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119170539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:41,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 02:53:41,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-11-28 02:53:41,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822275267] [2024-11-28 02:53:41,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:41,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:53:41,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:41,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:53:41,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-28 02:53:41,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 71 [2024-11-28 02:53:41,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 163 flow. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:41,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:53:41,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 71 [2024-11-28 02:53:41,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:53:41,612 INFO L124 PetriNetUnfolderBase]: 79/284 cut-off events. [2024-11-28 02:53:41,612 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-11-28 02:53:41,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 284 events. 79/284 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1285 event pairs, 30 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 520. Up to 154 conditions per place. [2024-11-28 02:53:41,615 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 45 selfloop transitions, 8 changer transitions 0/69 dead transitions. [2024-11-28 02:53:41,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 69 transitions, 301 flow [2024-11-28 02:53:41,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:53:41,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 02:53:41,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 296 transitions. [2024-11-28 02:53:41,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6948356807511737 [2024-11-28 02:53:41,617 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 163 flow. Second operand 6 states and 296 transitions. [2024-11-28 02:53:41,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 69 transitions, 301 flow [2024-11-28 02:53:41,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 69 transitions, 293 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 02:53:41,621 INFO L231 Difference]: Finished difference. Result has 76 places, 60 transitions, 203 flow [2024-11-28 02:53:41,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=203, PETRI_PLACES=76, PETRI_TRANSITIONS=60} [2024-11-28 02:53:41,621 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 3 predicate places. [2024-11-28 02:53:41,622 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 60 transitions, 203 flow [2024-11-28 02:53:41,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:41,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:53:41,622 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:41,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 02:53:41,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:53:41,823 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:53:41,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:41,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1207322127, now seen corresponding path program 1 times [2024-11-28 02:53:41,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:41,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041706639] [2024-11-28 02:53:41,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:41,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-28 02:53:42,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:42,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041706639] [2024-11-28 02:53:42,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041706639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:42,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:42,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:53:42,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817789842] [2024-11-28 02:53:42,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:42,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:53:42,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:42,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:53:42,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:53:42,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 71 [2024-11-28 02:53:42,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 60 transitions, 203 flow. Second operand has 6 states, 6 states have (on average 42.5) internal successors, (255), 6 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:42,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:53:42,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 71 [2024-11-28 02:53:42,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:53:42,495 INFO L124 PetriNetUnfolderBase]: 73/249 cut-off events. [2024-11-28 02:53:42,495 INFO L125 PetriNetUnfolderBase]: For 69/71 co-relation queries the response was YES. [2024-11-28 02:53:42,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 249 events. 73/249 cut-off events. For 69/71 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1015 event pairs, 47 based on Foata normal form. 10/236 useless extension candidates. Maximal degree in co-relation 519. Up to 125 conditions per place. [2024-11-28 02:53:42,497 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 47 selfloop transitions, 9 changer transitions 3/75 dead transitions. [2024-11-28 02:53:42,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 75 transitions, 351 flow [2024-11-28 02:53:42,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:53:42,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 02:53:42,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 287 transitions. [2024-11-28 02:53:42,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6737089201877934 [2024-11-28 02:53:42,500 INFO L175 Difference]: Start difference. First operand has 76 places, 60 transitions, 203 flow. Second operand 6 states and 287 transitions. [2024-11-28 02:53:42,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 75 transitions, 351 flow [2024-11-28 02:53:42,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 75 transitions, 347 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 02:53:42,504 INFO L231 Difference]: Finished difference. Result has 78 places, 59 transitions, 215 flow [2024-11-28 02:53:42,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=215, PETRI_PLACES=78, PETRI_TRANSITIONS=59} [2024-11-28 02:53:42,505 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 5 predicate places. [2024-11-28 02:53:42,506 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 59 transitions, 215 flow [2024-11-28 02:53:42,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.5) internal successors, (255), 6 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:42,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:53:42,506 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:42,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 02:53:42,506 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:53:42,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:42,507 INFO L85 PathProgramCache]: Analyzing trace with hash -927970432, now seen corresponding path program 1 times [2024-11-28 02:53:42,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:42,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034632907] [2024-11-28 02:53:42,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:42,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:43,073 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-28 02:53:43,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:43,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034632907] [2024-11-28 02:53:43,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034632907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:43,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:43,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:53:43,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845966449] [2024-11-28 02:53:43,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:43,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:53:43,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:43,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:53:43,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:53:43,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 71 [2024-11-28 02:53:43,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 59 transitions, 215 flow. Second operand has 7 states, 7 states have (on average 41.142857142857146) internal successors, (288), 7 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:43,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:53:43,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 71 [2024-11-28 02:53:43,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:53:43,621 INFO L124 PetriNetUnfolderBase]: 73/245 cut-off events. [2024-11-28 02:53:43,621 INFO L125 PetriNetUnfolderBase]: For 127/131 co-relation queries the response was YES. [2024-11-28 02:53:43,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 245 events. 73/245 cut-off events. For 127/131 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1002 event pairs, 39 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 540. Up to 153 conditions per place. [2024-11-28 02:53:43,623 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 48 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2024-11-28 02:53:43,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 66 transitions, 346 flow [2024-11-28 02:53:43,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:53:43,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 02:53:43,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2024-11-28 02:53:43,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.676056338028169 [2024-11-28 02:53:43,626 INFO L175 Difference]: Start difference. First operand has 78 places, 59 transitions, 215 flow. Second operand 4 states and 192 transitions. [2024-11-28 02:53:43,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 66 transitions, 346 flow [2024-11-28 02:53:43,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 66 transitions, 322 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 02:53:43,629 INFO L231 Difference]: Finished difference. Result has 75 places, 58 transitions, 199 flow [2024-11-28 02:53:43,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=75, PETRI_TRANSITIONS=58} [2024-11-28 02:53:43,630 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 2 predicate places. [2024-11-28 02:53:43,631 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 58 transitions, 199 flow [2024-11-28 02:53:43,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 41.142857142857146) internal successors, (288), 7 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:43,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:53:43,632 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:43,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 02:53:43,632 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:53:43,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:43,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1227719148, now seen corresponding path program 1 times [2024-11-28 02:53:43,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:43,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747260701] [2024-11-28 02:53:43,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:43,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:44,863 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-28 02:53:44,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:44,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747260701] [2024-11-28 02:53:44,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747260701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:53:44,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339668847] [2024-11-28 02:53:44,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:44,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:53:44,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:53:44,867 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:53:44,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 02:53:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:45,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-28 02:53:45,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:53:45,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:53:45,212 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2024-11-28 02:53:45,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2024-11-28 02:53:45,229 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 23 treesize of output 1 [2024-11-28 02:53:45,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 02:53:45,455 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 37 treesize of output 25 [2024-11-28 02:53:45,471 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 37 treesize of output 25 [2024-11-28 02:53:45,558 INFO L349 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2024-11-28 02:53:45,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 121 [2024-11-28 02:53:45,577 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 78 treesize of output 29 [2024-11-28 02:53:45,695 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 98 treesize of output 58 [2024-11-28 02:53:45,702 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 66 treesize of output 34 [2024-11-28 02:53:45,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:53:45,772 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-28 02:53:45,802 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-28 02:53:45,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:53:46,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:53:46,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2024-11-28 02:53:46,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:53:46,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 79 [2024-11-28 02:53:46,139 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 15 treesize of output 3 [2024-11-28 02:53:46,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:53:46,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 78 [2024-11-28 02:53:46,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:53:46,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 68 [2024-11-28 02:53:46,169 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:53:46,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:53:46,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 37 [2024-11-28 02:53:46,180 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 02:53:46,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:53:46,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 12 [2024-11-28 02:53:46,468 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-28 02:53:46,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339668847] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:53:46,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:53:46,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 30 [2024-11-28 02:53:46,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498810296] [2024-11-28 02:53:46,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:53:46,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-28 02:53:46,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:46,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-28 02:53:46,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=824, Unknown=9, NotChecked=0, Total=930 [2024-11-28 02:53:51,422 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 71 [2024-11-28 02:53:51,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 58 transitions, 199 flow. Second operand has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 31 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:51,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:53:51,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 71 [2024-11-28 02:53:51,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:53:52,874 INFO L124 PetriNetUnfolderBase]: 276/610 cut-off events. [2024-11-28 02:53:52,876 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2024-11-28 02:53:52,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 610 events. 276/610 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2791 event pairs, 84 based on Foata normal form. 0/434 useless extension candidates. Maximal degree in co-relation 1365. Up to 268 conditions per place. [2024-11-28 02:53:52,881 INFO L140 encePairwiseOnDemand]: 57/71 looper letters, 90 selfloop transitions, 20 changer transitions 0/111 dead transitions. [2024-11-28 02:53:52,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 111 transitions, 544 flow [2024-11-28 02:53:52,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:53:52,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-28 02:53:52,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 127 transitions. [2024-11-28 02:53:52,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.12776659959758552 [2024-11-28 02:53:52,886 INFO L175 Difference]: Start difference. First operand has 75 places, 58 transitions, 199 flow. Second operand 14 states and 127 transitions. [2024-11-28 02:53:52,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 111 transitions, 544 flow [2024-11-28 02:53:52,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 111 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 02:53:52,891 INFO L231 Difference]: Finished difference. Result has 91 places, 66 transitions, 297 flow [2024-11-28 02:53:52,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=297, PETRI_PLACES=91, PETRI_TRANSITIONS=66} [2024-11-28 02:53:52,892 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 18 predicate places. [2024-11-28 02:53:52,892 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 66 transitions, 297 flow [2024-11-28 02:53:52,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 31 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:52,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:53:52,892 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:52,904 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 02:53:53,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-28 02:53:53,097 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:53:53,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:53,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1227719149, now seen corresponding path program 1 times [2024-11-28 02:53:53,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:53,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847196647] [2024-11-28 02:53:53,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:53,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:54,100 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-28 02:53:54,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:54,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847196647] [2024-11-28 02:53:54,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847196647] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:53:54,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482183420] [2024-11-28 02:53:54,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:54,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:53:54,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:53:54,104 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:53:54,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 02:53:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:54,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-28 02:53:54,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:53:54,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:53:54,401 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2024-11-28 02:53:54,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2024-11-28 02:53:54,407 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 23 treesize of output 1 [2024-11-28 02:53:54,511 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 37 treesize of output 25 [2024-11-28 02:53:54,565 INFO L349 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2024-11-28 02:53:54,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 89 [2024-11-28 02:53:54,636 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 73 treesize of output 41 [2024-11-28 02:53:54,641 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 49 treesize of output 25 [2024-11-28 02:53:54,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:53:54,682 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-28 02:53:54,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:53:54,778 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2024-11-28 02:53:54,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2024-11-28 02:53:54,785 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1083 (Array Int Int))) (= (let ((.cse0 (+ |c_~#c~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_1083) (select (select |c_#memory_$Pointer$#0.base| |c_~#c~0.base|) .cse0)) (+ (select (select |c_#memory_$Pointer$#0.offset| |c_~#c~0.base|) .cse0) 4))) |c_ULTIMATE.start_list_add_~node#1.base|)) is different from false [2024-11-28 02:53:54,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:53:54,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2024-11-28 02:53:54,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:53:54,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 75 [2024-11-28 02:53:54,813 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 15 treesize of output 3 [2024-11-28 02:53:54,909 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-28 02:53:54,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482183420] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:53:54,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:53:54,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 26 [2024-11-28 02:53:54,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490262240] [2024-11-28 02:53:54,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:53:54,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-28 02:53:54,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:54,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-28 02:53:54,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=573, Unknown=1, NotChecked=48, Total=702 [2024-11-28 02:53:55,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 71 [2024-11-28 02:53:55,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 66 transitions, 297 flow. Second operand has 27 states, 27 states have (on average 8.703703703703704) internal successors, (235), 27 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:55,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:53:55,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 71 [2024-11-28 02:53:55,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:53:56,213 INFO L124 PetriNetUnfolderBase]: 208/497 cut-off events. [2024-11-28 02:53:56,213 INFO L125 PetriNetUnfolderBase]: For 327/329 co-relation queries the response was YES. [2024-11-28 02:53:56,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1288 conditions, 497 events. 208/497 cut-off events. For 327/329 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2212 event pairs, 66 based on Foata normal form. 15/458 useless extension candidates. Maximal degree in co-relation 1261. Up to 214 conditions per place. [2024-11-28 02:53:56,217 INFO L140 encePairwiseOnDemand]: 57/71 looper letters, 66 selfloop transitions, 20 changer transitions 0/90 dead transitions. [2024-11-28 02:53:56,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 90 transitions, 527 flow [2024-11-28 02:53:56,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:53:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-28 02:53:56,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 165 transitions. [2024-11-28 02:53:56,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.17876489707475623 [2024-11-28 02:53:56,220 INFO L175 Difference]: Start difference. First operand has 91 places, 66 transitions, 297 flow. Second operand 13 states and 165 transitions. [2024-11-28 02:53:56,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 90 transitions, 527 flow [2024-11-28 02:53:56,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 90 transitions, 510 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-11-28 02:53:56,227 INFO L231 Difference]: Finished difference. Result has 98 places, 66 transitions, 333 flow [2024-11-28 02:53:56,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=333, PETRI_PLACES=98, PETRI_TRANSITIONS=66} [2024-11-28 02:53:56,228 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 25 predicate places. [2024-11-28 02:53:56,228 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 66 transitions, 333 flow [2024-11-28 02:53:56,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.703703703703704) internal successors, (235), 27 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:53:56,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:53:56,229 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:56,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 02:53:56,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-28 02:53:56,430 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-28 02:53:56,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:56,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1297688244, now seen corresponding path program 1 times [2024-11-28 02:53:56,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:56,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309037002] [2024-11-28 02:53:56,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:56,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:53:56,704 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 02:53:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:53:56,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 02:53:56,803 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 02:53:56,804 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 50 remaining) [2024-11-28 02:53:56,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2024-11-28 02:53:56,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2024-11-28 02:53:56,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2024-11-28 02:53:56,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2024-11-28 02:53:56,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 50 remaining) [2024-11-28 02:53:56,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2024-11-28 02:53:56,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2024-11-28 02:53:56,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2024-11-28 02:53:56,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2024-11-28 02:53:56,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2024-11-28 02:53:56,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2024-11-28 02:53:56,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2024-11-28 02:53:56,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2024-11-28 02:53:56,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2024-11-28 02:53:56,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2024-11-28 02:53:56,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2024-11-28 02:53:56,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2024-11-28 02:53:56,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2024-11-28 02:53:56,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2024-11-28 02:53:56,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2024-11-28 02:53:56,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2024-11-28 02:53:56,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2024-11-28 02:53:56,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2024-11-28 02:53:56,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2024-11-28 02:53:56,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (24 of 50 remaining) [2024-11-28 02:53:56,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 50 remaining) [2024-11-28 02:53:56,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 50 remaining) [2024-11-28 02:53:56,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2024-11-28 02:53:56,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 50 remaining) [2024-11-28 02:53:56,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 50 remaining) [2024-11-28 02:53:56,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 50 remaining) [2024-11-28 02:53:56,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2024-11-28 02:53:56,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2024-11-28 02:53:56,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2024-11-28 02:53:56,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2024-11-28 02:53:56,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2024-11-28 02:53:56,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2024-11-28 02:53:56,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 50 remaining) [2024-11-28 02:53:56,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2024-11-28 02:53:56,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2024-11-28 02:53:56,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2024-11-28 02:53:56,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2024-11-28 02:53:56,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2024-11-28 02:53:56,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2024-11-28 02:53:56,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2024-11-28 02:53:56,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2024-11-28 02:53:56,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2024-11-28 02:53:56,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2024-11-28 02:53:56,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 50 remaining) [2024-11-28 02:53:56,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 02:53:56,814 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:56,861 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-28 02:53:56,862 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 02:53:56,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:53:56 BasicIcfg [2024-11-28 02:53:56,868 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 02:53:56,869 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 02:53:56,869 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 02:53:56,871 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 02:53:56,871 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:53:29" (3/4) ... [2024-11-28 02:53:56,872 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-28 02:53:56,980 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 27. [2024-11-28 02:53:57,085 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 02:53:57,086 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 02:53:57,086 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 02:53:57,087 INFO L158 Benchmark]: Toolchain (without parser) took 30297.22ms. Allocated memory was 117.4MB in the beginning and 276.8MB in the end (delta: 159.4MB). Free memory was 90.2MB in the beginning and 232.5MB in the end (delta: -142.3MB). Peak memory consumption was 168.5MB. Max. memory is 16.1GB. [2024-11-28 02:53:57,087 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 117.4MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:53:57,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 900.54ms. Allocated memory is still 117.4MB. Free memory was 90.0MB in the beginning and 49.4MB in the end (delta: 40.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-28 02:53:57,088 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.03ms. Allocated memory is still 117.4MB. Free memory was 49.4MB in the beginning and 46.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:53:57,088 INFO L158 Benchmark]: Boogie Preprocessor took 80.20ms. Allocated memory is still 117.4MB. Free memory was 46.5MB in the beginning and 43.2MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 02:53:57,088 INFO L158 Benchmark]: RCFGBuilder took 1590.23ms. Allocated memory is still 117.4MB. Free memory was 43.2MB in the beginning and 72.7MB in the end (delta: -29.5MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2024-11-28 02:53:57,089 INFO L158 Benchmark]: TraceAbstraction took 27406.06ms. Allocated memory was 117.4MB in the beginning and 276.8MB in the end (delta: 159.4MB). Free memory was 72.7MB in the beginning and 91.2MB in the end (delta: -18.5MB). Peak memory consumption was 140.3MB. Max. memory is 16.1GB. [2024-11-28 02:53:57,089 INFO L158 Benchmark]: Witness Printer took 216.97ms. Allocated memory is still 276.8MB. Free memory was 91.2MB in the beginning and 232.5MB in the end (delta: -141.3MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2024-11-28 02:53:57,091 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.40ms. Allocated memory is still 117.4MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 900.54ms. Allocated memory is still 117.4MB. Free memory was 90.0MB in the beginning and 49.4MB in the end (delta: 40.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.03ms. Allocated memory is still 117.4MB. Free memory was 49.4MB in the beginning and 46.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 80.20ms. Allocated memory is still 117.4MB. Free memory was 46.5MB in the beginning and 43.2MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1590.23ms. Allocated memory is still 117.4MB. Free memory was 43.2MB in the beginning and 72.7MB in the end (delta: -29.5MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. * TraceAbstraction took 27406.06ms. Allocated memory was 117.4MB in the beginning and 276.8MB in the end (delta: 159.4MB). Free memory was 72.7MB in the beginning and 91.2MB in the end (delta: -18.5MB). Peak memory consumption was 140.3MB. Max. memory is 16.1GB. * Witness Printer took 216.97ms. Allocated memory is still 276.8MB. Free memory was 91.2MB in the beginning and 232.5MB in the end (delta: -141.3MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1256] 0 int i = 0; VAL [c={1:0}, i=0] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=1] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=2] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=3] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=4] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=5] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=6] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=7] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=8] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=9] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=10] [L1256] COND FALSE 0 !(i < 10) [L1258] 0 int j = __VERIFIER_nondet_int(); [L1259] CALL 0 assume_abort_if_not(0 <= j && j < 10) [L11] COND FALSE 0 !(!cond) [L1259] RET 0 assume_abort_if_not(0 <= j && j < 10) [L1260] 0 struct s *p; [L1261] 0 pthread_t t1; [L1262] CALL, EXPR 0 new(1) [L1237] 0 struct s *p = malloc(sizeof(struct s)); [L1238] 0 p->datum = x VAL [c={1:0}] [L1239] 0 p->next = ((void *)0) [L1240] 0 return p; [L1262] RET, EXPR 0 new(1) [L1262] 0 c.slots[j] = new(1) [L1263] CALL, EXPR 0 new(2) [L1237] 0 struct s *p = malloc(sizeof(struct s)); [L1238] 0 p->datum = x VAL [c={1:0}] [L1239] 0 p->next = ((void *)0) [L1240] 0 return p; [L1263] RET, EXPR 0 new(2) [L1263] EXPR 0 c.slots[j] [L1263] CALL 0 list_add(new(2), c.slots[j]) [L1243] EXPR 0 list->next [L1243] 0 struct s *temp = list->next; [L1244] 0 list->next = node VAL [c={1:0}] [L1245] 0 node->next = temp [L1263] RET 0 list_add(new(2), c.slots[j]) [L1264] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [c={1:0}, j=9, t1=-1] [L1248] 1 int i = __VERIFIER_nondet_int(); [L1249] CALL 1 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 1 !(!cond) [L1249] RET 1 assume_abort_if_not(0 <= i && i < 10) [L1251] CALL, EXPR 1 new(3) [L1237] 1 struct s *p = malloc(sizeof(struct s)); [L1238] 1 p->datum = x VAL [\old(arg)={0:0}, arg={0:0}, c={1:0}, i=0] [L1239] 1 p->next = ((void *)0) [L1240] 1 return p; [L1251] RET, EXPR 1 new(3) [L1251] EXPR 1 c.slots[i] [L1251] CALL 1 list_add(new(3), c.slots[i]) [L1243] 1 list->next - 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: 1255]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1264]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 96 locations, 50 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 27.2s, OverallIterations: 19, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 27 mSolverCounterUnknown, 3343 SdHoareTripleChecker+Valid, 11.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2528 mSDsluCounter, 2296 SdHoareTripleChecker+Invalid, 9.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 107 IncrementalHoareTripleChecker+Unchecked, 2153 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11380 IncrementalHoareTripleChecker+Invalid, 11647 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 143 mSDtfsCounter, 11380 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 272 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=333occurred in iteration=18, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 455 NumberOfCodeBlocks, 441 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 468 ConstructedInterpolants, 2 QuantifiedInterpolants, 5225 SizeOfPredicates, 53 NumberOfNonLiveVariables, 1810 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 27 InterpolantComputations, 14 PerfectInterpolantSequences, 1037/1077 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-28 02:53:57,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e4fa5b1-db37-417b-9f1b-940719bd2c6a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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)