./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.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_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/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_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/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_6f9d6ed3-254d-4d8a-836c-19403369e9d2/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 f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:31:02,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:31:02,950 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-27 20:31:02,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:31:02,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:31:03,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:31:03,002 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:31:03,003 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:31:03,003 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:31:03,004 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:31:03,004 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:31:03,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:31:03,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:31:03,006 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:31:03,006 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:31:03,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:31:03,006 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:31:03,006 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:31:03,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:31:03,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:31:03,006 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 20:31:03,006 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 20:31:03,007 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 20:31:03,007 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:31:03,007 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:31:03,007 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 20:31:03,007 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:31:03,007 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:31:03,007 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:31:03,007 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:31:03,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:31:03,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:31:03,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:31:03,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:31:03,008 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:31:03,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:31:03,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:31:03,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:31:03,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:31:03,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:31:03,008 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:31:03,008 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:31:03,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:31:03,009 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:31:03,009 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:31:03,010 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:31:03,010 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:31:03,010 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_6f9d6ed3-254d-4d8a-836c-19403369e9d2/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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2024-11-27 20:31:03,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:31:03,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:31:03,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:31:03,348 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:31:03,348 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:31:03,349 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2024-11-27 20:31:06,370 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/data/c85ad7e65/f00a193b54994345ba95d96e48d00e1c/FLAGe5398c6ba [2024-11-27 20:31:06,804 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:31:06,807 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/sv-benchmarks/c/pthread/queue_ok_longer.i [2024-11-27 20:31:06,824 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/data/c85ad7e65/f00a193b54994345ba95d96e48d00e1c/FLAGe5398c6ba [2024-11-27 20:31:06,839 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/data/c85ad7e65/f00a193b54994345ba95d96e48d00e1c [2024-11-27 20:31:06,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:31:06,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:31:06,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:31:06,844 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:31:06,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:31:06,849 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:31:06" (1/1) ... [2024-11-27 20:31:06,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@397e1a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:06, skipping insertion in model container [2024-11-27 20:31:06,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:31:06" (1/1) ... [2024-11-27 20:31:06,893 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:31:07,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:31:07,434 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:31:07,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:31:07,623 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:31:07,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:07 WrapperNode [2024-11-27 20:31:07,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:31:07,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:31:07,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:31:07,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:31:07,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:07" (1/1) ... [2024-11-27 20:31:07,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:07" (1/1) ... [2024-11-27 20:31:07,743 INFO L138 Inliner]: procedures = 274, calls = 854, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 999 [2024-11-27 20:31:07,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:31:07,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:31:07,745 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:31:07,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:31:07,754 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:07" (1/1) ... [2024-11-27 20:31:07,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:07" (1/1) ... [2024-11-27 20:31:07,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:07" (1/1) ... [2024-11-27 20:31:07,795 INFO L175 MemorySlicer]: Split 835 memory accesses to 4 slices as follows [426, 2, 5, 402]. 51 percent of accesses are in the largest equivalence class. The 810 initializations are split as follows [403, 2, 5, 400]. The 11 writes are split as follows [10, 0, 0, 1]. [2024-11-27 20:31:07,795 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:07" (1/1) ... [2024-11-27 20:31:07,796 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:07" (1/1) ... [2024-11-27 20:31:07,848 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:07" (1/1) ... [2024-11-27 20:31:07,854 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:07" (1/1) ... [2024-11-27 20:31:07,858 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:07" (1/1) ... [2024-11-27 20:31:07,866 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:07" (1/1) ... [2024-11-27 20:31:07,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:07" (1/1) ... [2024-11-27 20:31:07,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:31:07,879 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:31:07,879 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:31:07,879 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:31:07,880 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:07" (1/1) ... [2024-11-27 20:31:07,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:31:07,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:31:07,957 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:31:07,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:31:07,988 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-27 20:31:07,988 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-27 20:31:07,988 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-27 20:31:07,988 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-27 20:31:07,988 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-27 20:31:07,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-27 20:31:07,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-27 20:31:07,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-27 20:31:07,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-27 20:31:07,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-27 20:31:07,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-27 20:31:07,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-27 20:31:07,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-27 20:31:07,990 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-27 20:31:07,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:31:07,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 20:31:07,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-27 20:31:07,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-27 20:31:07,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-27 20:31:07,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:31:07,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:31:07,994 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-27 20:31:08,177 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:31:08,178 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:31:10,165 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-27 20:31:10,166 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:31:18,897 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:31:18,898 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-27 20:31:18,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:31:18 BoogieIcfgContainer [2024-11-27 20:31:18,898 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:31:18,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:31:18,902 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:31:18,909 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:31:18,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:31:06" (1/3) ... [2024-11-27 20:31:18,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e65c0ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:31:18, skipping insertion in model container [2024-11-27 20:31:18,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:31:07" (2/3) ... [2024-11-27 20:31:18,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e65c0ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:31:18, skipping insertion in model container [2024-11-27 20:31:18,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:31:18" (3/3) ... [2024-11-27 20:31:18,913 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2024-11-27 20:31:18,936 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:31:18,938 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok_longer.i that has 3 procedures, 119 locations, 1 initial locations, 2 loop locations, and 53 error locations. [2024-11-27 20:31:18,941 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-27 20:31:19,106 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-27 20:31:19,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 129 transitions, 272 flow [2024-11-27 20:31:19,304 INFO L124 PetriNetUnfolderBase]: 11/127 cut-off events. [2024-11-27 20:31:19,308 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-27 20:31:19,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 127 events. 11/127 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 396 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 99. Up to 3 conditions per place. [2024-11-27 20:31:19,316 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 129 transitions, 272 flow [2024-11-27 20:31:19,327 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 126 transitions, 264 flow [2024-11-27 20:31:19,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:31:19,364 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;@6c17b7bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:31:19,364 INFO L334 AbstractCegarLoop]: Starting to check reachability of 96 error locations. [2024-11-27 20:31:19,574 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 20:31:19,574 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2024-11-27 20:31:19,575 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:31:19,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:31:19,576 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-11-27 20:31:19,576 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-27 20:31:19,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:31:19,582 INFO L85 PathProgramCache]: Analyzing trace with hash 69480, now seen corresponding path program 1 times [2024-11-27 20:31:19,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:31:19,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068449277] [2024-11-27 20:31:19,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:31:19,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:31:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:31:20,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:31:20,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:31:20,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068449277] [2024-11-27 20:31:20,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068449277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:31:20,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:31:20,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 20:31:20,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330162223] [2024-11-27 20:31:20,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:31:20,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:31:20,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:31:20,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:31:20,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:31:21,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 129 [2024-11-27 20:31:21,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 126 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-27 20:31:21,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:31:21,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 129 [2024-11-27 20:31:21,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:31:21,957 INFO L124 PetriNetUnfolderBase]: 1087/2983 cut-off events. [2024-11-27 20:31:21,958 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2024-11-27 20:31:21,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4723 conditions, 2983 events. 1087/2983 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 23593 event pairs, 837 based on Foata normal form. 68/2108 useless extension candidates. Maximal degree in co-relation 4566. Up to 1686 conditions per place. [2024-11-27 20:31:22,006 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 45 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2024-11-27 20:31:22,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 114 transitions, 334 flow [2024-11-27 20:31:22,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:31:22,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:31:22,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2024-11-27 20:31:22,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6873385012919897 [2024-11-27 20:31:22,033 INFO L175 Difference]: Start difference. First operand has 122 places, 126 transitions, 264 flow. Second operand 3 states and 266 transitions. [2024-11-27 20:31:22,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 114 transitions, 334 flow [2024-11-27 20:31:22,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 114 transitions, 326 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-27 20:31:22,050 INFO L231 Difference]: Finished difference. Result has 112 places, 114 transitions, 236 flow [2024-11-27 20:31:22,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=112, PETRI_TRANSITIONS=114} [2024-11-27 20:31:22,059 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -10 predicate places. [2024-11-27 20:31:22,060 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 114 transitions, 236 flow [2024-11-27 20:31:22,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-27 20:31:22,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:31:22,061 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-11-27 20:31:22,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 20:31:22,062 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-27 20:31:22,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:31:22,063 INFO L85 PathProgramCache]: Analyzing trace with hash 69481, now seen corresponding path program 1 times [2024-11-27 20:31:22,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:31:22,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560981965] [2024-11-27 20:31:22,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:31:22,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:31:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:31:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:31:23,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:31:23,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560981965] [2024-11-27 20:31:23,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560981965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:31:23,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:31:23,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 20:31:23,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762554460] [2024-11-27 20:31:23,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:31:23,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:31:23,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:31:23,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:31:23,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:31:23,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 129 [2024-11-27 20:31:23,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 114 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-27 20:31:23,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:31:23,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 129 [2024-11-27 20:31:23,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:31:23,930 INFO L124 PetriNetUnfolderBase]: 1087/2980 cut-off events. [2024-11-27 20:31:23,930 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-27 20:31:23,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4686 conditions, 2980 events. 1087/2980 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 23600 event pairs, 837 based on Foata normal form. 3/2042 useless extension candidates. Maximal degree in co-relation 4675. Up to 1686 conditions per place. [2024-11-27 20:31:23,964 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 45 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2024-11-27 20:31:23,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 111 transitions, 324 flow [2024-11-27 20:31:23,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:31:23,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:31:23,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2024-11-27 20:31:23,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6795865633074936 [2024-11-27 20:31:23,967 INFO L175 Difference]: Start difference. First operand has 112 places, 114 transitions, 236 flow. Second operand 3 states and 263 transitions. [2024-11-27 20:31:23,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 111 transitions, 324 flow [2024-11-27 20:31:23,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 111 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:31:23,971 INFO L231 Difference]: Finished difference. Result has 109 places, 111 transitions, 230 flow [2024-11-27 20:31:23,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=109, PETRI_TRANSITIONS=111} [2024-11-27 20:31:23,973 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -13 predicate places. [2024-11-27 20:31:23,973 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 111 transitions, 230 flow [2024-11-27 20:31:23,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-27 20:31:23,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:31:23,973 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-27 20:31:23,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 20:31:23,974 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-27 20:31:23,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:31:23,974 INFO L85 PathProgramCache]: Analyzing trace with hash 2072018934, now seen corresponding path program 1 times [2024-11-27 20:31:23,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:31:23,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294443073] [2024-11-27 20:31:23,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:31:23,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:31:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:31:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:31:24,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:31:24,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294443073] [2024-11-27 20:31:24,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294443073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:31:24,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:31:24,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:31:24,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431884956] [2024-11-27 20:31:24,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:31:24,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:31:24,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:31:24,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:31:24,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:31:24,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 129 [2024-11-27 20:31:24,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 111 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 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-27 20:31:24,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:31:24,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 129 [2024-11-27 20:31:24,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:31:25,364 INFO L124 PetriNetUnfolderBase]: 1087/2978 cut-off events. [2024-11-27 20:31:25,365 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-27 20:31:25,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4684 conditions, 2978 events. 1087/2978 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 23582 event pairs, 837 based on Foata normal form. 1/2040 useless extension candidates. Maximal degree in co-relation 4673. Up to 1685 conditions per place. [2024-11-27 20:31:25,391 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 44 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2024-11-27 20:31:25,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 109 transitions, 320 flow [2024-11-27 20:31:25,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:31:25,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-27 20:31:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2024-11-27 20:31:25,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6531007751937985 [2024-11-27 20:31:25,394 INFO L175 Difference]: Start difference. First operand has 109 places, 111 transitions, 230 flow. Second operand 4 states and 337 transitions. [2024-11-27 20:31:25,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 109 transitions, 320 flow [2024-11-27 20:31:25,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 109 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:31:25,398 INFO L231 Difference]: Finished difference. Result has 108 places, 109 transitions, 228 flow [2024-11-27 20:31:25,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=108, PETRI_TRANSITIONS=109} [2024-11-27 20:31:25,400 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -14 predicate places. [2024-11-27 20:31:25,400 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 109 transitions, 228 flow [2024-11-27 20:31:25,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 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-27 20:31:25,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:31:25,401 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-27 20:31:25,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 20:31:25,401 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-27 20:31:25,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:31:25,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2072018935, now seen corresponding path program 1 times [2024-11-27 20:31:25,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:31:25,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726878607] [2024-11-27 20:31:25,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:31:25,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:31:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:31:26,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:31:26,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:31:26,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726878607] [2024-11-27 20:31:26,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726878607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:31:26,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:31:26,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:31:26,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885495014] [2024-11-27 20:31:26,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:31:26,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:31:26,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:31:26,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:31:26,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:31:26,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 129 [2024-11-27 20:31:26,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 109 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 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-27 20:31:26,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:31:26,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 129 [2024-11-27 20:31:26,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:31:27,081 INFO L124 PetriNetUnfolderBase]: 1087/2976 cut-off events. [2024-11-27 20:31:27,082 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-27 20:31:27,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4683 conditions, 2976 events. 1087/2976 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 23562 event pairs, 837 based on Foata normal form. 2/2040 useless extension candidates. Maximal degree in co-relation 4668. Up to 1685 conditions per place. [2024-11-27 20:31:27,107 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 44 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2024-11-27 20:31:27,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 107 transitions, 318 flow [2024-11-27 20:31:27,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:31:27,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-27 20:31:27,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2024-11-27 20:31:27,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6531007751937985 [2024-11-27 20:31:27,110 INFO L175 Difference]: Start difference. First operand has 108 places, 109 transitions, 228 flow. Second operand 4 states and 337 transitions. [2024-11-27 20:31:27,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 107 transitions, 318 flow [2024-11-27 20:31:27,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 107 transitions, 312 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-27 20:31:27,114 INFO L231 Difference]: Finished difference. Result has 106 places, 107 transitions, 224 flow [2024-11-27 20:31:27,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=106, PETRI_TRANSITIONS=107} [2024-11-27 20:31:27,115 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -16 predicate places. [2024-11-27 20:31:27,115 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 107 transitions, 224 flow [2024-11-27 20:31:27,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 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-27 20:31:27,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:31:27,116 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:31:27,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 20:31:27,117 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-27 20:31:27,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:31:27,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1010708321, now seen corresponding path program 1 times [2024-11-27 20:31:27,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:31:27,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479309627] [2024-11-27 20:31:27,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:31:27,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:31:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:31:27,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:31:27,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:31:27,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479309627] [2024-11-27 20:31:27,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479309627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:31:27,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:31:27,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:31:27,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221048844] [2024-11-27 20:31:27,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:31:27,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:31:27,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:31:27,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:31:27,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:31:28,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 129 [2024-11-27 20:31:28,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 107 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 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-27 20:31:28,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:31:28,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 129 [2024-11-27 20:31:28,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:31:28,956 INFO L124 PetriNetUnfolderBase]: 1044/2659 cut-off events. [2024-11-27 20:31:28,956 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-27 20:31:28,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4321 conditions, 2659 events. 1044/2659 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 20019 event pairs, 424 based on Foata normal form. 120/2115 useless extension candidates. Maximal degree in co-relation 4306. Up to 879 conditions per place. [2024-11-27 20:31:28,982 INFO L140 encePairwiseOnDemand]: 119/129 looper letters, 67 selfloop transitions, 3 changer transitions 0/123 dead transitions. [2024-11-27 20:31:28,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 123 transitions, 397 flow [2024-11-27 20:31:28,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:31:28,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-27 20:31:28,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 345 transitions. [2024-11-27 20:31:28,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6686046511627907 [2024-11-27 20:31:28,984 INFO L175 Difference]: Start difference. First operand has 106 places, 107 transitions, 224 flow. Second operand 4 states and 345 transitions. [2024-11-27 20:31:28,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 123 transitions, 397 flow [2024-11-27 20:31:28,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 123 transitions, 391 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-27 20:31:28,989 INFO L231 Difference]: Finished difference. Result has 99 places, 100 transitions, 210 flow [2024-11-27 20:31:28,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=99, PETRI_TRANSITIONS=100} [2024-11-27 20:31:28,990 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -23 predicate places. [2024-11-27 20:31:28,990 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 100 transitions, 210 flow [2024-11-27 20:31:28,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 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-27 20:31:28,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:31:28,991 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:31:28,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 20:31:28,991 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-27 20:31:28,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:31:28,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1010708320, now seen corresponding path program 1 times [2024-11-27 20:31:28,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:31:28,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108175946] [2024-11-27 20:31:28,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:31:28,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:31:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:31:29,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:31:29,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:31:29,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108175946] [2024-11-27 20:31:29,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108175946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:31:29,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:31:29,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:31:29,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463478791] [2024-11-27 20:31:29,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:31:29,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:31:29,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:31:29,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:31:29,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:31:29,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 129 [2024-11-27 20:31:29,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 100 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 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-27 20:31:29,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:31:29,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 129 [2024-11-27 20:31:29,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:31:30,224 INFO L124 PetriNetUnfolderBase]: 1044/2353 cut-off events. [2024-11-27 20:31:30,224 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-11-27 20:31:30,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4093 conditions, 2353 events. 1044/2353 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 15853 event pairs, 424 based on Foata normal form. 120/1999 useless extension candidates. Maximal degree in co-relation 1949. Up to 879 conditions per place. [2024-11-27 20:31:30,252 INFO L140 encePairwiseOnDemand]: 118/129 looper letters, 67 selfloop transitions, 3 changer transitions 0/115 dead transitions. [2024-11-27 20:31:30,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 115 transitions, 381 flow [2024-11-27 20:31:30,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:31:30,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-27 20:31:30,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 342 transitions. [2024-11-27 20:31:30,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6627906976744186 [2024-11-27 20:31:30,254 INFO L175 Difference]: Start difference. First operand has 99 places, 100 transitions, 210 flow. Second operand 4 states and 342 transitions. [2024-11-27 20:31:30,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 115 transitions, 381 flow [2024-11-27 20:31:30,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 115 transitions, 375 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-27 20:31:30,260 INFO L231 Difference]: Finished difference. Result has 91 places, 92 transitions, 194 flow [2024-11-27 20:31:30,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=91, PETRI_TRANSITIONS=92} [2024-11-27 20:31:30,262 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -31 predicate places. [2024-11-27 20:31:30,266 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 92 transitions, 194 flow [2024-11-27 20:31:30,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 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-27 20:31:30,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:31:30,266 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:31:30,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 20:31:30,267 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-27 20:31:30,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:31:30,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1267189077, now seen corresponding path program 1 times [2024-11-27 20:31:30,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:31:30,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200032426] [2024-11-27 20:31:30,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:31:30,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:31:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:31:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:31:31,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:31:31,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200032426] [2024-11-27 20:31:31,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200032426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:31:31,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:31:31,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:31:31,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834714857] [2024-11-27 20:31:31,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:31:31,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:31:31,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:31:31,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:31:31,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:31:32,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 129 [2024-11-27 20:31:32,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 92 transitions, 194 flow. Second operand has 7 states, 7 states have (on average 59.857142857142854) internal successors, (419), 7 states have internal predecessors, (419), 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-27 20:31:32,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:31:32,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 129 [2024-11-27 20:31:32,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:31:33,457 INFO L124 PetriNetUnfolderBase]: 2063/4250 cut-off events. [2024-11-27 20:31:33,457 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-11-27 20:31:33,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7671 conditions, 4250 events. 2063/4250 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 29490 event pairs, 287 based on Foata normal form. 0/3446 useless extension candidates. Maximal degree in co-relation 2867. Up to 2157 conditions per place. [2024-11-27 20:31:33,482 INFO L140 encePairwiseOnDemand]: 120/129 looper letters, 132 selfloop transitions, 11 changer transitions 0/182 dead transitions. [2024-11-27 20:31:33,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 182 transitions, 667 flow [2024-11-27 20:31:33,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:31:33,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-27 20:31:33,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 551 transitions. [2024-11-27 20:31:33,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6101882613510521 [2024-11-27 20:31:33,485 INFO L175 Difference]: Start difference. First operand has 91 places, 92 transitions, 194 flow. Second operand 7 states and 551 transitions. [2024-11-27 20:31:33,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 182 transitions, 667 flow [2024-11-27 20:31:33,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 182 transitions, 659 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-27 20:31:33,492 INFO L231 Difference]: Finished difference. Result has 98 places, 102 transitions, 262 flow [2024-11-27 20:31:33,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=98, PETRI_TRANSITIONS=102} [2024-11-27 20:31:33,493 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2024-11-27 20:31:33,494 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 102 transitions, 262 flow [2024-11-27 20:31:33,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 59.857142857142854) internal successors, (419), 7 states have internal predecessors, (419), 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-27 20:31:33,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:31:33,494 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:31:33,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 20:31:33,495 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-27 20:31:33,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:31:33,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1772452785, now seen corresponding path program 1 times [2024-11-27 20:31:33,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:31:33,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575200498] [2024-11-27 20:31:33,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:31:33,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:31:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:31:33,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:31:33,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:31:33,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575200498] [2024-11-27 20:31:33,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575200498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:31:33,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:31:33,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:31:33,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667051196] [2024-11-27 20:31:33,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:31:33,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:31:33,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:31:33,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:31:33,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:31:33,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 129 [2024-11-27 20:31:33,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 102 transitions, 262 flow. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 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-27 20:31:33,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:31:33,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 129 [2024-11-27 20:31:33,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:31:34,612 INFO L124 PetriNetUnfolderBase]: 1788/4083 cut-off events. [2024-11-27 20:31:34,612 INFO L125 PetriNetUnfolderBase]: For 288/288 co-relation queries the response was YES. [2024-11-27 20:31:34,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7510 conditions, 4083 events. 1788/4083 cut-off events. For 288/288 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 30770 event pairs, 1242 based on Foata normal form. 64/3283 useless extension candidates. Maximal degree in co-relation 7125. Up to 2610 conditions per place. [2024-11-27 20:31:34,643 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 74 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2024-11-27 20:31:34,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 122 transitions, 477 flow [2024-11-27 20:31:34,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:31:34,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-27 20:31:34,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 355 transitions. [2024-11-27 20:31:34,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.687984496124031 [2024-11-27 20:31:34,646 INFO L175 Difference]: Start difference. First operand has 98 places, 102 transitions, 262 flow. Second operand 4 states and 355 transitions. [2024-11-27 20:31:34,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 122 transitions, 477 flow [2024-11-27 20:31:34,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 122 transitions, 475 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 20:31:34,655 INFO L231 Difference]: Finished difference. Result has 98 places, 100 transitions, 262 flow [2024-11-27 20:31:34,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=262, PETRI_PLACES=98, PETRI_TRANSITIONS=100} [2024-11-27 20:31:34,656 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2024-11-27 20:31:34,658 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 100 transitions, 262 flow [2024-11-27 20:31:34,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 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-27 20:31:34,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:31:34,659 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:31:34,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 20:31:34,659 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-27 20:31:34,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:31:34,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1772452784, now seen corresponding path program 1 times [2024-11-27 20:31:34,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:31:34,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893661726] [2024-11-27 20:31:34,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:31:34,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:31:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:31:34,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:31:34,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:31:34,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893661726] [2024-11-27 20:31:34,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893661726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:31:34,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:31:34,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:31:34,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185386480] [2024-11-27 20:31:34,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:31:34,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:31:34,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:31:34,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:31:34,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:31:34,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 129 [2024-11-27 20:31:34,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 100 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 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-27 20:31:34,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:31:34,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 129 [2024-11-27 20:31:34,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:31:35,319 INFO L124 PetriNetUnfolderBase]: 692/1626 cut-off events. [2024-11-27 20:31:35,319 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2024-11-27 20:31:35,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3117 conditions, 1626 events. 692/1626 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 9878 event pairs, 446 based on Foata normal form. 45/1450 useless extension candidates. Maximal degree in co-relation 3073. Up to 693 conditions per place. [2024-11-27 20:31:35,328 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 59 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2024-11-27 20:31:35,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 107 transitions, 391 flow [2024-11-27 20:31:35,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:31:35,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:31:35,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2024-11-27 20:31:35,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7260981912144703 [2024-11-27 20:31:35,330 INFO L175 Difference]: Start difference. First operand has 98 places, 100 transitions, 262 flow. Second operand 3 states and 281 transitions. [2024-11-27 20:31:35,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 107 transitions, 391 flow [2024-11-27 20:31:35,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 107 transitions, 383 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-11-27 20:31:35,337 INFO L231 Difference]: Finished difference. Result has 96 places, 96 transitions, 245 flow [2024-11-27 20:31:35,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=245, PETRI_PLACES=96, PETRI_TRANSITIONS=96} [2024-11-27 20:31:35,339 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -26 predicate places. [2024-11-27 20:31:35,339 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 96 transitions, 245 flow [2024-11-27 20:31:35,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 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-27 20:31:35,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:31:35,340 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:31:35,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 20:31:35,340 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-27 20:31:35,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:31:35,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2119241775, now seen corresponding path program 1 times [2024-11-27 20:31:35,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:31:35,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289346451] [2024-11-27 20:31:35,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:31:35,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:31:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:31:35,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:31:35,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:31:35,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289346451] [2024-11-27 20:31:35,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289346451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:31:35,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:31:35,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:31:35,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596075596] [2024-11-27 20:31:35,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:31:35,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:31:35,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:31:35,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:31:35,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:31:35,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 129 [2024-11-27 20:31:35,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 96 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-27 20:31:35,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:31:35,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 129 [2024-11-27 20:31:35,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:31:35,840 INFO L124 PetriNetUnfolderBase]: 572/1370 cut-off events. [2024-11-27 20:31:35,840 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-11-27 20:31:35,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2651 conditions, 1370 events. 572/1370 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 7442 event pairs, 380 based on Foata normal form. 12/1196 useless extension candidates. Maximal degree in co-relation 1700. Up to 753 conditions per place. [2024-11-27 20:31:35,847 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 62 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2024-11-27 20:31:35,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 109 transitions, 397 flow [2024-11-27 20:31:35,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:31:35,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:31:35,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2024-11-27 20:31:35,849 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7416020671834626 [2024-11-27 20:31:35,849 INFO L175 Difference]: Start difference. First operand has 96 places, 96 transitions, 245 flow. Second operand 3 states and 287 transitions. [2024-11-27 20:31:35,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 109 transitions, 397 flow [2024-11-27 20:31:35,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 109 transitions, 389 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-27 20:31:35,853 INFO L231 Difference]: Finished difference. Result has 97 places, 96 transitions, 244 flow [2024-11-27 20:31:35,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=97, PETRI_TRANSITIONS=96} [2024-11-27 20:31:35,854 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -25 predicate places. [2024-11-27 20:31:35,854 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 96 transitions, 244 flow [2024-11-27 20:31:35,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-27 20:31:35,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:31:35,855 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:31:35,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 20:31:35,855 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-27 20:31:35,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:31:35,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1654718486, now seen corresponding path program 1 times [2024-11-27 20:31:35,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:31:35,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039984303] [2024-11-27 20:31:35,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:31:35,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:31:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:31:36,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:31:36,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:31:36,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039984303] [2024-11-27 20:31:36,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039984303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:31:36,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:31:36,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:31:36,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208814340] [2024-11-27 20:31:36,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:31:36,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:31:36,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:31:36,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:31:36,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:31:36,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 129 [2024-11-27 20:31:36,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 96 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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-27 20:31:36,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:31:36,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 129 [2024-11-27 20:31:36,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:31:36,789 INFO L124 PetriNetUnfolderBase]: 587/1373 cut-off events. [2024-11-27 20:31:36,789 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2024-11-27 20:31:36,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2716 conditions, 1373 events. 587/1373 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 7334 event pairs, 395 based on Foata normal form. 12/1223 useless extension candidates. Maximal degree in co-relation 1532. Up to 779 conditions per place. [2024-11-27 20:31:36,797 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 62 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2024-11-27 20:31:36,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 109 transitions, 401 flow [2024-11-27 20:31:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:31:36,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-27 20:31:36,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 358 transitions. [2024-11-27 20:31:36,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6937984496124031 [2024-11-27 20:31:36,803 INFO L175 Difference]: Start difference. First operand has 97 places, 96 transitions, 244 flow. Second operand 4 states and 358 transitions. [2024-11-27 20:31:36,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 109 transitions, 401 flow [2024-11-27 20:31:36,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 109 transitions, 399 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 20:31:36,806 INFO L231 Difference]: Finished difference. Result has 100 places, 96 transitions, 252 flow [2024-11-27 20:31:36,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=100, PETRI_TRANSITIONS=96} [2024-11-27 20:31:36,807 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -22 predicate places. [2024-11-27 20:31:36,807 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 96 transitions, 252 flow [2024-11-27 20:31:36,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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-27 20:31:36,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:31:36,808 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:31:36,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 20:31:36,808 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-27 20:31:36,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:31:36,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1654718487, now seen corresponding path program 1 times [2024-11-27 20:31:36,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:31:36,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290390620] [2024-11-27 20:31:36,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:31:36,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:31:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:31:37,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:31:37,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:31:37,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290390620] [2024-11-27 20:31:37,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290390620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:31:37,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:31:37,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 20:31:37,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930912059] [2024-11-27 20:31:37,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:31:37,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:31:37,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:31:37,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:31:37,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:31:37,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 129 [2024-11-27 20:31:37,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 96 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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-27 20:31:37,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:31:37,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 129 [2024-11-27 20:31:37,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:31:37,425 INFO L124 PetriNetUnfolderBase]: 572/1325 cut-off events. [2024-11-27 20:31:37,425 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2024-11-27 20:31:37,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2674 conditions, 1325 events. 572/1325 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 6940 event pairs, 515 based on Foata normal form. 31/1203 useless extension candidates. Maximal degree in co-relation 898. Up to 1007 conditions per place. [2024-11-27 20:31:37,432 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 50 selfloop transitions, 1 changer transitions 0/94 dead transitions. [2024-11-27 20:31:37,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 94 transitions, 350 flow [2024-11-27 20:31:37,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:31:37,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:31:37,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2024-11-27 20:31:37,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6847545219638242 [2024-11-27 20:31:37,435 INFO L175 Difference]: Start difference. First operand has 100 places, 96 transitions, 252 flow. Second operand 3 states and 265 transitions. [2024-11-27 20:31:37,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 94 transitions, 350 flow [2024-11-27 20:31:37,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 94 transitions, 344 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-27 20:31:37,439 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 244 flow [2024-11-27 20:31:37,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=97, PETRI_TRANSITIONS=94} [2024-11-27 20:31:37,440 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -25 predicate places. [2024-11-27 20:31:37,442 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 244 flow [2024-11-27 20:31:37,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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-27 20:31:37,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:31:37,443 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:31:37,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 20:31:37,443 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-27 20:31:37,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:31:37,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1918474182, now seen corresponding path program 1 times [2024-11-27 20:31:37,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:31:37,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924042477] [2024-11-27 20:31:37,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:31:37,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:31:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:31:38,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:31:38,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:31:38,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924042477] [2024-11-27 20:31:38,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924042477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:31:38,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:31:38,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:31:38,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100508343] [2024-11-27 20:31:38,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:31:38,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:31:38,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:31:38,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:31:38,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:31:39,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 129 [2024-11-27 20:31:39,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 244 flow. Second operand has 9 states, 9 states have (on average 70.44444444444444) internal successors, (634), 9 states have internal predecessors, (634), 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-27 20:31:39,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:31:39,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 129 [2024-11-27 20:31:39,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:31:39,875 INFO L124 PetriNetUnfolderBase]: 658/1413 cut-off events. [2024-11-27 20:31:39,875 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2024-11-27 20:31:39,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2897 conditions, 1413 events. 658/1413 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 7112 event pairs, 168 based on Foata normal form. 0/1288 useless extension candidates. Maximal degree in co-relation 2884. Up to 771 conditions per place. [2024-11-27 20:31:39,883 INFO L140 encePairwiseOnDemand]: 118/129 looper letters, 100 selfloop transitions, 10 changer transitions 0/145 dead transitions. [2024-11-27 20:31:39,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 145 transitions, 571 flow [2024-11-27 20:31:39,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:31:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-27 20:31:39,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 722 transitions. [2024-11-27 20:31:39,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6218776916451335 [2024-11-27 20:31:39,887 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 244 flow. Second operand 9 states and 722 transitions. [2024-11-27 20:31:39,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 145 transitions, 571 flow [2024-11-27 20:31:39,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 145 transitions, 568 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-27 20:31:39,892 INFO L231 Difference]: Finished difference. Result has 107 places, 96 transitions, 278 flow [2024-11-27 20:31:39,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=278, PETRI_PLACES=107, PETRI_TRANSITIONS=96} [2024-11-27 20:31:39,893 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -15 predicate places. [2024-11-27 20:31:39,894 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 96 transitions, 278 flow [2024-11-27 20:31:39,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 70.44444444444444) internal successors, (634), 9 states have internal predecessors, (634), 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-27 20:31:39,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:31:39,895 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:31:39,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 20:31:39,895 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-27 20:31:39,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:31:39,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1309817834, now seen corresponding path program 1 times [2024-11-27 20:31:39,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:31:39,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483324113] [2024-11-27 20:31:39,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:31:39,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:31:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:31:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:31:42,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:31:42,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483324113] [2024-11-27 20:31:42,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483324113] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:31:42,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695805101] [2024-11-27 20:31:42,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:31:42,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:31:42,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:31:42,242 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:31:42,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:31:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:31:42,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 1856 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-27 20:31:42,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:31:42,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 20:31:42,962 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 23 treesize of output 11 [2024-11-27 20:31:43,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:31:43,275 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 27 treesize of output 11 [2024-11-27 20:31:43,335 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 23 treesize of output 11 [2024-11-27 20:31:43,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-27 20:31:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:31:43,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:32:32,899 INFO L349 Elim1Store]: treesize reduction 47, result has 52.5 percent of original size [2024-11-27 20:32:32,899 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 3 case distinctions, treesize of input 210 treesize of output 234 [2024-11-27 20:32:32,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:32:32,935 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 83 treesize of output 83 [2024-11-27 20:32:33,000 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 8 treesize of output 4 [2024-11-27 20:32:33,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:32:33,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 93 [2024-11-27 20:32:33,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:32:33,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:32:33,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:32:33,249 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 2 case distinctions, treesize of input 42 treesize of output 47 [2024-11-27 20:32:33,260 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2024-11-27 20:32:33,266 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:32:33,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:32:33,272 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-27 20:32:33,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:32:33,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695805101] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:32:33,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:32:33,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 29 [2024-11-27 20:32:33,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21347816] [2024-11-27 20:32:33,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:32:33,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-27 20:32:33,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:32:33,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-27 20:32:33,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=775, Unknown=8, NotChecked=0, Total=930 [2024-11-27 20:32:38,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:32:42,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:32:47,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:32:51,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:32:55,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:32:59,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:33:04,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:33:08,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:33:12,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:33:17,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:33:21,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:33:25,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:33:29,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:33:33,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:33:39,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:33:43,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:33:47,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:33:51,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:33:56,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:33:59,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:34:03,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:34:07,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:34:11,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:34:15,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:34:20,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:34:26,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:34:28,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:34:33,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:34:37,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:34:41,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:34:45,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:34:49,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:34:49,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 129 [2024-11-27 20:34:49,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 96 transitions, 278 flow. Second operand has 31 states, 31 states have (on average 28.516129032258064) internal successors, (884), 31 states have internal predecessors, (884), 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-27 20:34:49,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:34:49,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 129 [2024-11-27 20:34:49,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:34:56,090 INFO L124 PetriNetUnfolderBase]: 1519/2904 cut-off events. [2024-11-27 20:34:56,090 INFO L125 PetriNetUnfolderBase]: For 234/234 co-relation queries the response was YES. [2024-11-27 20:34:56,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6448 conditions, 2904 events. 1519/2904 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 15255 event pairs, 263 based on Foata normal form. 24/2700 useless extension candidates. Maximal degree in co-relation 6431. Up to 1037 conditions per place. [2024-11-27 20:34:56,110 INFO L140 encePairwiseOnDemand]: 119/129 looper letters, 211 selfloop transitions, 20 changer transitions 0/247 dead transitions. [2024-11-27 20:34:56,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 247 transitions, 1109 flow [2024-11-27 20:34:56,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 20:34:56,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-27 20:34:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 594 transitions. [2024-11-27 20:34:56,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3289036544850498 [2024-11-27 20:34:56,114 INFO L175 Difference]: Start difference. First operand has 107 places, 96 transitions, 278 flow. Second operand 14 states and 594 transitions. [2024-11-27 20:34:56,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 247 transitions, 1109 flow [2024-11-27 20:34:56,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 247 transitions, 1093 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-27 20:34:56,121 INFO L231 Difference]: Finished difference. Result has 119 places, 110 transitions, 385 flow [2024-11-27 20:34:56,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=385, PETRI_PLACES=119, PETRI_TRANSITIONS=110} [2024-11-27 20:34:56,122 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -3 predicate places. [2024-11-27 20:34:56,122 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 110 transitions, 385 flow [2024-11-27 20:34:56,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 28.516129032258064) internal successors, (884), 31 states have internal predecessors, (884), 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-27 20:34:56,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:34:56,124 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:34:56,139 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 20:34:56,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-27 20:34:56,328 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-27 20:34:56,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:34:56,329 INFO L85 PathProgramCache]: Analyzing trace with hash 115278135, now seen corresponding path program 1 times [2024-11-27 20:34:56,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:34:56,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981135590] [2024-11-27 20:34:56,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:34:56,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:34:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:56,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:34:56,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:34:56,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981135590] [2024-11-27 20:34:56,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981135590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:34:56,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:34:56,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 20:34:56,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745184155] [2024-11-27 20:34:56,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:34:56,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:34:56,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:34:56,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:34:56,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:34:56,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 129 [2024-11-27 20:34:56,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 110 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-27 20:34:56,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:34:56,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 129 [2024-11-27 20:34:56,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:34:57,029 INFO L124 PetriNetUnfolderBase]: 1068/2444 cut-off events. [2024-11-27 20:34:57,029 INFO L125 PetriNetUnfolderBase]: For 448/448 co-relation queries the response was YES. [2024-11-27 20:34:57,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5465 conditions, 2444 events. 1068/2444 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 14611 event pairs, 983 based on Foata normal form. 7/2200 useless extension candidates. Maximal degree in co-relation 5444. Up to 1897 conditions per place. [2024-11-27 20:34:57,046 INFO L140 encePairwiseOnDemand]: 127/129 looper letters, 62 selfloop transitions, 1 changer transitions 3/109 dead transitions. [2024-11-27 20:34:57,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 109 transitions, 513 flow [2024-11-27 20:34:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:34:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:34:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2024-11-27 20:34:57,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2024-11-27 20:34:57,048 INFO L175 Difference]: Start difference. First operand has 119 places, 110 transitions, 385 flow. Second operand 3 states and 267 transitions. [2024-11-27 20:34:57,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 109 transitions, 513 flow [2024-11-27 20:34:57,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 109 transitions, 483 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-11-27 20:34:57,056 INFO L231 Difference]: Finished difference. Result has 115 places, 106 transitions, 347 flow [2024-11-27 20:34:57,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=347, PETRI_PLACES=115, PETRI_TRANSITIONS=106} [2024-11-27 20:34:57,057 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -7 predicate places. [2024-11-27 20:34:57,057 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 106 transitions, 347 flow [2024-11-27 20:34:57,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-27 20:34:57,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:34:57,058 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:34:57,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-27 20:34:57,058 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-27 20:34:57,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:34:57,059 INFO L85 PathProgramCache]: Analyzing trace with hash 128707996, now seen corresponding path program 1 times [2024-11-27 20:34:57,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:34:57,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008627481] [2024-11-27 20:34:57,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:34:57,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:34:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:57,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 20:34:57,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:34:57,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008627481] [2024-11-27 20:34:57,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008627481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:34:57,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:34:57,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:34:57,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032872258] [2024-11-27 20:34:57,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:34:57,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:34:57,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:34:57,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:34:57,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:34:57,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 129 [2024-11-27 20:34:57,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 106 transitions, 347 flow. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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-27 20:34:57,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:34:57,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 129 [2024-11-27 20:34:57,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:34:57,798 INFO L124 PetriNetUnfolderBase]: 707/1798 cut-off events. [2024-11-27 20:34:57,799 INFO L125 PetriNetUnfolderBase]: For 230/230 co-relation queries the response was YES. [2024-11-27 20:34:57,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3956 conditions, 1798 events. 707/1798 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 9973 event pairs, 123 based on Foata normal form. 74/1697 useless extension candidates. Maximal degree in co-relation 3936. Up to 1098 conditions per place. [2024-11-27 20:34:57,809 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 67 selfloop transitions, 4 changer transitions 0/114 dead transitions. [2024-11-27 20:34:57,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 114 transitions, 507 flow [2024-11-27 20:34:57,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:34:57,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:34:57,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2024-11-27 20:34:57,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7157622739018088 [2024-11-27 20:34:57,812 INFO L175 Difference]: Start difference. First operand has 115 places, 106 transitions, 347 flow. Second operand 3 states and 277 transitions. [2024-11-27 20:34:57,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 114 transitions, 507 flow [2024-11-27 20:34:57,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 114 transitions, 506 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 20:34:57,817 INFO L231 Difference]: Finished difference. Result has 114 places, 106 transitions, 354 flow [2024-11-27 20:34:57,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=114, PETRI_TRANSITIONS=106} [2024-11-27 20:34:57,818 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -8 predicate places. [2024-11-27 20:34:57,818 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 106 transitions, 354 flow [2024-11-27 20:34:57,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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-27 20:34:57,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:34:57,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:34:57,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-27 20:34:57,819 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-27 20:34:57,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:34:57,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1995395968, now seen corresponding path program 1 times [2024-11-27 20:34:57,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:34:57,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147395523] [2024-11-27 20:34:57,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:34:57,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:34:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:58,030 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-27 20:34:58,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:34:58,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147395523] [2024-11-27 20:34:58,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147395523] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:34:58,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517520489] [2024-11-27 20:34:58,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:34:58,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:34:58,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:34:58,033 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:34:58,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:34:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:34:58,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 1887 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:34:58,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:34:58,502 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-27 20:34:58,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:34:58,581 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-27 20:34:58,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517520489] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:34:58,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:34:58,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-27 20:34:58,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773453618] [2024-11-27 20:34:58,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:34:58,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:34:58,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:34:58,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:34:58,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:34:58,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 129 [2024-11-27 20:34:58,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 106 transitions, 354 flow. Second operand has 7 states, 7 states have (on average 80.71428571428571) internal successors, (565), 7 states have internal predecessors, (565), 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-27 20:34:58,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:34:58,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 129 [2024-11-27 20:34:58,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:34:59,294 INFO L124 PetriNetUnfolderBase]: 1087/2634 cut-off events. [2024-11-27 20:34:59,294 INFO L125 PetriNetUnfolderBase]: For 440/440 co-relation queries the response was YES. [2024-11-27 20:34:59,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6275 conditions, 2634 events. 1087/2634 cut-off events. For 440/440 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 14208 event pairs, 352 based on Foata normal form. 60/2474 useless extension candidates. Maximal degree in co-relation 6255. Up to 733 conditions per place. [2024-11-27 20:34:59,306 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 108 selfloop transitions, 8 changer transitions 0/159 dead transitions. [2024-11-27 20:34:59,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 159 transitions, 776 flow [2024-11-27 20:34:59,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:34:59,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 20:34:59,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 542 transitions. [2024-11-27 20:34:59,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7002583979328165 [2024-11-27 20:34:59,313 INFO L175 Difference]: Start difference. First operand has 114 places, 106 transitions, 354 flow. Second operand 6 states and 542 transitions. [2024-11-27 20:34:59,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 159 transitions, 776 flow [2024-11-27 20:34:59,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 159 transitions, 772 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 20:34:59,322 INFO L231 Difference]: Finished difference. Result has 122 places, 111 transitions, 413 flow [2024-11-27 20:34:59,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=413, PETRI_PLACES=122, PETRI_TRANSITIONS=111} [2024-11-27 20:34:59,323 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 0 predicate places. [2024-11-27 20:34:59,324 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 111 transitions, 413 flow [2024-11-27 20:34:59,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 80.71428571428571) internal successors, (565), 7 states have internal predecessors, (565), 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-27 20:34:59,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:34:59,324 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:34:59,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-27 20:34:59,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-27 20:34:59,525 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-27 20:34:59,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:34:59,526 INFO L85 PathProgramCache]: Analyzing trace with hash -866981963, now seen corresponding path program 1 times [2024-11-27 20:34:59,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:34:59,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215638053] [2024-11-27 20:34:59,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:34:59,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:34:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:00,116 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:35:00,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:00,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215638053] [2024-11-27 20:35:00,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215638053] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:35:00,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458689270] [2024-11-27 20:35:00,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:00,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:35:00,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:35:00,120 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:35:00,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 20:35:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:00,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 1900 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-27 20:35:00,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:35:01,298 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:35:01,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:35:01,694 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:35:01,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458689270] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:35:01,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:35:01,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2024-11-27 20:35:01,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176540532] [2024-11-27 20:35:01,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:35:01,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 20:35:01,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:01,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 20:35:01,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:35:03,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 129 [2024-11-27 20:35:03,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 111 transitions, 413 flow. Second operand has 12 states, 12 states have (on average 79.25) internal successors, (951), 12 states have internal predecessors, (951), 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-27 20:35:03,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:35:03,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 129 [2024-11-27 20:35:03,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:35:04,983 INFO L124 PetriNetUnfolderBase]: 1087/2566 cut-off events. [2024-11-27 20:35:04,983 INFO L125 PetriNetUnfolderBase]: For 794/794 co-relation queries the response was YES. [2024-11-27 20:35:04,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6497 conditions, 2566 events. 1087/2566 cut-off events. For 794/794 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 13311 event pairs, 151 based on Foata normal form. 80/2429 useless extension candidates. Maximal degree in co-relation 6473. Up to 603 conditions per place. [2024-11-27 20:35:04,996 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 113 selfloop transitions, 9 changer transitions 4/168 dead transitions. [2024-11-27 20:35:04,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 168 transitions, 861 flow [2024-11-27 20:35:04,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:35:04,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-27 20:35:04,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 692 transitions. [2024-11-27 20:35:04,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6705426356589147 [2024-11-27 20:35:05,000 INFO L175 Difference]: Start difference. First operand has 122 places, 111 transitions, 413 flow. Second operand 8 states and 692 transitions. [2024-11-27 20:35:05,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 168 transitions, 861 flow [2024-11-27 20:35:05,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 168 transitions, 851 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-27 20:35:05,010 INFO L231 Difference]: Finished difference. Result has 126 places, 110 transitions, 417 flow [2024-11-27 20:35:05,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=417, PETRI_PLACES=126, PETRI_TRANSITIONS=110} [2024-11-27 20:35:05,011 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 4 predicate places. [2024-11-27 20:35:05,011 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 110 transitions, 417 flow [2024-11-27 20:35:05,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 79.25) internal successors, (951), 12 states have internal predecessors, (951), 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-27 20:35:05,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:35:05,012 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:05,027 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-27 20:35:05,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-27 20:35:05,213 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-27 20:35:05,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:05,214 INFO L85 PathProgramCache]: Analyzing trace with hash 729120934, now seen corresponding path program 1 times [2024-11-27 20:35:05,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:05,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94030217] [2024-11-27 20:35:05,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:05,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:08,485 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-27 20:35:08,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:08,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94030217] [2024-11-27 20:35:08,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94030217] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:35:08,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755516790] [2024-11-27 20:35:08,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:08,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:35:08,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:35:08,488 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:35:08,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 20:35:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:08,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 2013 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-27 20:35:08,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:35:09,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 20:35:09,956 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-27 20:35:09,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:35:10,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-27 20:35:10,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:35:10,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:35:10,803 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-27 20:35:10,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755516790] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:35:10,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:35:10,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 18 [2024-11-27 20:35:10,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028942784] [2024-11-27 20:35:10,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:35:10,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-27 20:35:10,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:10,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-27 20:35:10,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-27 20:35:15,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 129 [2024-11-27 20:35:15,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 110 transitions, 417 flow. Second operand has 20 states, 20 states have (on average 65.35) internal successors, (1307), 20 states have internal predecessors, (1307), 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-27 20:35:15,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:35:15,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 129 [2024-11-27 20:35:15,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:35:17,201 INFO L124 PetriNetUnfolderBase]: 1439/3190 cut-off events. [2024-11-27 20:35:17,201 INFO L125 PetriNetUnfolderBase]: For 971/971 co-relation queries the response was YES. [2024-11-27 20:35:17,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8163 conditions, 3190 events. 1439/3190 cut-off events. For 971/971 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 17083 event pairs, 167 based on Foata normal form. 10/2947 useless extension candidates. Maximal degree in co-relation 8138. Up to 800 conditions per place. [2024-11-27 20:35:17,212 INFO L140 encePairwiseOnDemand]: 118/129 looper letters, 118 selfloop transitions, 29 changer transitions 5/184 dead transitions. [2024-11-27 20:35:17,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 184 transitions, 965 flow [2024-11-27 20:35:17,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 20:35:17,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-27 20:35:17,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 843 transitions. [2024-11-27 20:35:17,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5445736434108527 [2024-11-27 20:35:17,216 INFO L175 Difference]: Start difference. First operand has 126 places, 110 transitions, 417 flow. Second operand 12 states and 843 transitions. [2024-11-27 20:35:17,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 184 transitions, 965 flow [2024-11-27 20:35:17,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 184 transitions, 938 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-27 20:35:17,227 INFO L231 Difference]: Finished difference. Result has 134 places, 121 transitions, 573 flow [2024-11-27 20:35:17,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=573, PETRI_PLACES=134, PETRI_TRANSITIONS=121} [2024-11-27 20:35:17,228 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 12 predicate places. [2024-11-27 20:35:17,228 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 121 transitions, 573 flow [2024-11-27 20:35:17,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 65.35) internal successors, (1307), 20 states have internal predecessors, (1307), 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-27 20:35:17,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:35:17,230 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:17,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-27 20:35:17,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:35:17,434 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-27 20:35:17,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:17,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1200394486, now seen corresponding path program 2 times [2024-11-27 20:35:17,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:17,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867736519] [2024-11-27 20:35:17,435 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:35:17,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:17,580 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:35:17,580 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:35:23,832 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:35:23,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:23,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867736519] [2024-11-27 20:35:23,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867736519] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:35:23,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461272777] [2024-11-27 20:35:23,832 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:35:23,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:35:23,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:35:23,835 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:35:23,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f9d6ed3-254d-4d8a-836c-19403369e9d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 20:35:24,366 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:35:24,367 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:35:24,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 2020 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-27 20:35:24,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:35:24,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 20:35:24,584 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 23 treesize of output 11 [2024-11-27 20:35:24,998 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-27 20:35:24,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 14 [2024-11-27 20:35:25,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-27 20:35:25,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-27 20:35:25,570 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-27 20:35:25,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 14 [2024-11-27 20:35:25,631 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 23 treesize of output 11 [2024-11-27 20:35:25,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-27 20:35:26,222 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-27 20:35:26,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 14 [2024-11-27 20:35:26,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-27 20:35:26,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2024-11-27 20:35:26,794 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 22 treesize of output 10 [2024-11-27 20:35:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:35:26,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:36:08,641 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int#0| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse8 .cse7)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (forall ((v_ArrVal_444 Int)) (let ((.cse5 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_444))) (let ((.cse1 (select .cse5 .cse7))) (or (= 400 .cse1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| Int) (v_ArrVal_446 Int)) (or (< .cse1 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse2 (select (store |c_#memory_int#0| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_446) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| 1))) |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)))) (or (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (forall ((v_ArrVal_450 Int)) (<= (+ (* (select (store .cse2 .cse4 v_ArrVal_450) .cse3) 4) |c_~#queue~0.offset| 8) (select |c_#length| |c_~#queue~0.base|))) (< .cse4 0)))))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (forall ((v_ArrVal_444 Int)) (let ((.cse11 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_444))) (let ((.cse12 (select .cse11 .cse7))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| Int) (v_ArrVal_446 Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse9 (select (store |c_#memory_int#0| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse11 .cse6 v_ArrVal_446) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| 1))) |c_~#queue~0.base|)) (.cse10 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)))) (or (< (select .cse9 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (forall ((v_ArrVal_450 Int)) (<= 0 (+ (* (select (store .cse9 .cse10 v_ArrVal_450) .cse3) 4) |c_~#queue~0.offset| 4))) (< .cse10 0)))) (< .cse12 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44|))) (= 400 .cse12)))))))))) is different from false [2024-11-27 20:36:31,262 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (store |c_#memory_int#0| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int#0| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (select .cse6 .cse4)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (or (forall ((v_ArrVal_444 Int)) (let ((.cse2 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_444))) (let ((.cse0 (select .cse2 .cse4))) (or (= .cse0 400) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| Int) (v_ArrVal_446 Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| 1)) (.cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)))) (or (< .cse1 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (forall ((v_ArrVal_450 Int)) (<= 0 (+ (* (select (store (store (store .cse2 .cse3 v_ArrVal_446) .cse4 .cse1) .cse5 v_ArrVal_450) .cse4) 4) |c_~#queue~0.offset| 4))) (< .cse5 0)))))))))) (< .cse7 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (or (< .cse7 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (forall ((v_ArrVal_444 Int)) (let ((.cse10 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_444))) (let ((.cse8 (select .cse10 .cse4))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| Int) (v_ArrVal_446 Int)) (or (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| 1)) (.cse11 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)))) (or (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (forall ((v_ArrVal_450 Int)) (<= (+ (* (select (store (store (store .cse10 .cse3 v_ArrVal_446) .cse4 .cse9) .cse11 v_ArrVal_450) .cse4) 4) |c_~#queue~0.offset| 8) (select |c_#length| |c_~#queue~0.base|))) (< .cse11 0)))))) (= .cse8 400)))))))))) is different from false [2024-11-27 20:36:35,518 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int#0| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select .cse8 .cse9))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (let ((.cse1 (select (store |c_#memory_int#0| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47| 1))) |c_~#queue~0.base|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (forall ((v_ArrVal_444 Int)) (let ((.cse4 (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_444))) (let ((.cse7 (select .cse4 .cse2))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| Int) (v_ArrVal_446 Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| 1)) (.cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)))) (or (< .cse3 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (forall ((v_ArrVal_450 Int)) (<= (+ |c_~#queue~0.offset| 8 (* 4 (select (store (store (store .cse4 .cse5 v_ArrVal_446) .cse2 .cse3) .cse6 v_ArrVal_450) .cse2))) (select |c_#length| |c_~#queue~0.base|))) (< .cse6 0)))) (< .cse7 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44|))) (= 400 .cse7)))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47| Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (let ((.cse14 (select (store |c_#memory_int#0| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47| 1))) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_444 Int)) (let ((.cse11 (store .cse14 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_444))) (let ((.cse13 (select .cse11 .cse2))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| Int) (v_ArrVal_446 Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| 1)) (.cse12 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)))) (or (< .cse10 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (forall ((v_ArrVal_450 Int)) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (store (store (store .cse11 .cse5 v_ArrVal_446) .cse2 .cse10) .cse12 v_ArrVal_450) .cse2)) 4))) (< .cse12 0)))) (< .cse13 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44|))) (= 400 .cse13))))) (< (select .cse14 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)))) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47|)))))) is different from false [2024-11-27 20:39:16,187 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int#0| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse11 (select .cse10 .cse1))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47| Int) (v_ArrVal_442 Int) (v_ArrVal_439 Int)) (let ((.cse0 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_439))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (let ((.cse2 (select (store |c_#memory_int#0| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse9 v_ArrVal_442) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47| 1))) |c_~#queue~0.base|))) (or (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (forall ((v_ArrVal_444 Int)) (let ((.cse6 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_444))) (let ((.cse4 (select .cse6 .cse3))) (or (= 400 .cse4) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| Int) (v_ArrVal_446 Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| 1)) (.cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)))) (or (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (forall ((v_ArrVal_450 Int)) (<= 0 (+ (* (select (store (store (store .cse6 .cse7 v_ArrVal_446) .cse3 .cse5) .cse8 v_ArrVal_450) .cse3) 4) |c_~#queue~0.offset| 4))) (< .cse8 0)))) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44|))))))))))))) (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47| Int) (v_ArrVal_442 Int) (v_ArrVal_439 Int)) (let ((.cse12 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_439))) (or (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (let ((.cse17 (select (store |c_#memory_int#0| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse9 v_ArrVal_442) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47| 1))) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_444 Int)) (let ((.cse15 (store .cse17 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_444))) (let ((.cse13 (select .cse15 .cse3))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| Int) (v_ArrVal_446 Int)) (or (< .cse13 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse14 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| 1)) (.cse16 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)))) (or (< .cse14 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (forall ((v_ArrVal_450 Int)) (<= (+ (* (select (store (store (store .cse15 .cse7 v_ArrVal_446) .cse3 .cse14) .cse16 v_ArrVal_450) .cse3) 4) |c_~#queue~0.offset| 8) (select |c_#length| |c_~#queue~0.base|))) (< .cse16 0)))))) (= 400 .cse13))))) (< (select .cse17 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|))))))) (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|)))))) is different from false [2024-11-27 20:42:21,921 INFO L349 Elim1Store]: treesize reduction 94, result has 52.3 percent of original size [2024-11-27 20:42:21,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 771 treesize of output 739 [2024-11-27 20:42:22,033 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-27 20:42:22,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 528 treesize of output 524 [2024-11-27 20:42:22,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:42:22,099 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 527 treesize of output 511 [2024-11-27 20:42:28,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1376 treesize of output 1364 [2024-11-27 20:42:31,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2730 treesize of output 2666 [2024-11-27 20:42:34,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:42:34,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1516 treesize of output 1486 [2024-11-27 20:42:39,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:42:39,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4202 treesize of output 3928 [2024-11-27 20:42:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 27 refuted. 2 times theorem prover too weak. 0 trivial. 13 not checked. [2024-11-27 20:42:42,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461272777] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:42:42,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:42:42,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 25] total 62 [2024-11-27 20:42:42,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833031595] [2024-11-27 20:42:42,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:42:43,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-27 20:42:43,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:42:43,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-27 20:42:43,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=2921, Unknown=70, NotChecked=476, Total=4032 [2024-11-27 20:42:43,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 129 [2024-11-27 20:42:43,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 121 transitions, 573 flow. Second operand has 64 states, 64 states have (on average 28.25) internal successors, (1808), 64 states have internal predecessors, (1808), 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-27 20:42:43,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:42:43,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 129 [2024-11-27 20:42:43,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:42:59,399 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int#0| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse14 (select |c_#memory_int#0| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse13 (select .cse14 .cse2)) (.cse5 (select .cse3 .cse4))) (let ((.cse16 (* .cse5 4)) (.cse9 (= 400 .cse5)) (.cse12 (+ .cse5 1)) (.cse26 (+ 1608 |c_~#queue~0.offset|)) (.cse11 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse10 (* .cse13 4)) (.cse8 (select |c_#length| |c_~#queue~0.base|))) (and (or (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse0 (select (store |c_#memory_int#0| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| 1))) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)))) (or (forall ((v_ArrVal_450 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (store .cse0 .cse1 v_ArrVal_450) .cse2) 4) 4))) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (< .cse1 0)))) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| Int)) (or (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse6 (select (store |c_#memory_int#0| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| 1))) |c_~#queue~0.base|)) (.cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)))) (or (forall ((v_ArrVal_450 Int)) (<= (+ |c_~#queue~0.offset| (* (select (store .cse6 .cse7 v_ArrVal_450) .cse2) 4) 8) .cse8)) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (< .cse7 0))))))) .cse9) (<= 0 (+ .cse10 |c_~#queue~0.offset|)) (forall ((v_ArrVal_451 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int#0| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse11 v_ArrVal_451) .cse4 .cse12)) |c_~#queue~0.base|) .cse2) 4)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse15 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)))) (or (< .cse13 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (forall ((v_ArrVal_450 Int)) (<= (+ |c_~#queue~0.offset| 8 (* 4 (select (store .cse14 .cse15 v_ArrVal_450) .cse2))) .cse8)) (< .cse15 0)))) (<= (+ 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| .cse16) (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (<= 0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| .cse16)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse18 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_451 Int) (v_ArrVal_450 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int#0| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse17 (store .cse3 .cse18 v_ArrVal_450))) (store (store .cse17 .cse11 v_ArrVal_451) .cse4 (+ (select .cse17 .cse4) 1)))) |c_~#queue~0.base|) .cse2) 4)))) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (< .cse18 0)))) (or (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| Int) (v_ArrVal_446 Int)) (or (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse19 (select (store |c_#memory_int#0| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse11 v_ArrVal_446) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| 1))) |c_~#queue~0.base|)) (.cse20 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)))) (or (< (select .cse19 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (forall ((v_ArrVal_450 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (store .cse19 .cse20 v_ArrVal_450) .cse2) 4) 4))) (< .cse20 0)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| Int) (v_ArrVal_446 Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse21 (select (store |c_#memory_int#0| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse11 v_ArrVal_446) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| 1))) |c_~#queue~0.base|)) (.cse22 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)))) (or (< (select .cse21 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (forall ((v_ArrVal_450 Int)) (<= (+ |c_~#queue~0.offset| (* (select (store .cse21 .cse22 v_ArrVal_450) .cse2) 4) 8) .cse8)) (< .cse22 0)))) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44|)))) .cse9) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (or (< .cse13 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (forall ((v_ArrVal_444 Int)) (let ((.cse25 (store .cse14 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_444))) (let ((.cse23 (select .cse25 .cse2))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| Int) (v_ArrVal_446 Int)) (or (< .cse23 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse24 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| 1)) (.cse27 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)))) (or (< .cse24 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (forall ((v_ArrVal_450 Int)) (<= 0 (+ (* (select (store (store (store .cse25 .cse26 v_ArrVal_446) .cse2 .cse24) .cse27 v_ArrVal_450) .cse2) 4) |c_~#queue~0.offset| 4))) (< .cse27 0)))))) (= .cse23 400))))))) (forall ((v_ArrVal_451 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int#0| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse11 v_ArrVal_451) .cse4 .cse12)) |c_~#queue~0.base|) .cse2) 4) 4) .cse8)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (or (< .cse13 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (forall ((v_ArrVal_444 Int)) (let ((.cse29 (store .cse14 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_444))) (let ((.cse31 (select .cse29 .cse2))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| Int) (v_ArrVal_446 Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse28 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| 1)) (.cse30 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)))) (or (< .cse28 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (forall ((v_ArrVal_450 Int)) (<= (+ (* (select (store (store (store .cse29 .cse26 v_ArrVal_446) .cse2 .cse28) .cse30 v_ArrVal_450) .cse2) 4) |c_~#queue~0.offset| 8) .cse8)) (< .cse30 0)))) (< .cse31 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44|))) (= .cse31 400))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse33 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (forall ((v_ArrVal_451 Int) (v_ArrVal_450 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int#0| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse32 (store .cse3 .cse33 v_ArrVal_450))) (store (store .cse32 .cse11 v_ArrVal_451) .cse4 (+ (select .cse32 .cse4) 1)))) |c_~#queue~0.base|) .cse2) 4) 4) .cse8)) (< .cse33 0)))) (<= (+ .cse10 |c_~#queue~0.offset| 4) .cse8) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48| Int)) (let ((.cse34 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|)))) (or (< .cse13 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_48|) (forall ((v_ArrVal_450 Int)) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (store .cse14 .cse34 v_ArrVal_450) .cse2)) 4))) (< .cse34 0)))))))) is different from false [2024-11-27 20:43:47,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:44:54,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:44:58,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:45:02,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:45:07,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:45:11,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:45:15,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:45:19,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-27 20:45:23,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]