./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for memory safety (deref-memtrack)
Using default analysis
Version 6497de01
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC --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 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-6497de0
[2024-11-24 02:01:19,566 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-24 02:01:19,632 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2024-11-24 02:01:19,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-24 02:01:19,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-24 02:01:19,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-24 02:01:19,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-24 02:01:19,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-24 02:01:19,698 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-24 02:01:19,698 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-24 02:01:19,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-24 02:01:19,698 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-24 02:01:19,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-24 02:01:19,700 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-24 02:01:19,701 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-24 02:01:19,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-24 02:01:19,702 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-24 02:01:19,702 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-24 02:01:19,702 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-24 02:01:19,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-24 02:01:19,703 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-24 02:01:19,703 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-24 02:01:19,703 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-24 02:01:19,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-24 02:01:19,703 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-24 02:01:19,703 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-24 02:01:19,703 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-24 02:01:19,704 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-11-24 02:01:19,704 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-24 02:01:19,704 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-24 02:01:19,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 02:01:19,705 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-24 02:01:19,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 02:01:19,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 02:01:19,705 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-24 02:01:19,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 02:01:19,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-24 02:01:19,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 02:01:19,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 02:01:19,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-24 02:01:19,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-24 02:01:19,706 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-24 02:01:19,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-24 02:01:19,706 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-24 02:01:19,707 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-24 02:01:19,707 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-24 02:01:19,707 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-24 02:01:19,707 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_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC
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 -> 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60
[2024-11-24 02:01:20,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-24 02:01:20,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-24 02:01:20,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-24 02:01:20,112 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-24 02:01:20,113 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-24 02:01:20,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread/queue.i
[2024-11-24 02:01:23,280 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/data/c88d0689e/b5d0068bff754a8c8e797865ed40979c/FLAG70737436f
[2024-11-24 02:01:23,742 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-24 02:01:23,743 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/sv-benchmarks/c/pthread/queue.i
[2024-11-24 02:01:23,771 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/data/c88d0689e/b5d0068bff754a8c8e797865ed40979c/FLAG70737436f
[2024-11-24 02:01:23,856 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/data/c88d0689e/b5d0068bff754a8c8e797865ed40979c
[2024-11-24 02:01:23,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-24 02:01:23,863 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-24 02:01:23,865 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-24 02:01:23,865 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-24 02:01:23,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-24 02:01:23,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 02:01:23" (1/1) ...
[2024-11-24 02:01:23,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51bee056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:23, skipping insertion in model container
[2024-11-24 02:01:23,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 02:01:23" (1/1) ...
[2024-11-24 02:01:23,945 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-24 02:01:24,588 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 02:01:24,607 INFO L200 MainTranslator]: Completed pre-run
[2024-11-24 02:01:24,688 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 02:01:24,758 INFO L204 MainTranslator]: Completed translation
[2024-11-24 02:01:24,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:24 WrapperNode
[2024-11-24 02:01:24,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-24 02:01:24,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-24 02:01:24,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-24 02:01:24,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-24 02:01:24,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:24" (1/1) ...
[2024-11-24 02:01:24,782 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:24" (1/1) ...
[2024-11-24 02:01:24,819 INFO L138 Inliner]: procedures = 274, calls = 107, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 293
[2024-11-24 02:01:24,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-24 02:01:24,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-24 02:01:24,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-24 02:01:24,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-24 02:01:24,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:24" (1/1) ...
[2024-11-24 02:01:24,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:24" (1/1) ...
[2024-11-24 02:01:24,838 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:24" (1/1) ...
[2024-11-24 02:01:24,877 INFO L175 MemorySlicer]: Split 92 memory accesses to 5 slices as follows [2, 8, 5, 23, 54]. 59 percent of accesses are in the largest equivalence class. The 58 initializations are split as follows [2, 8, 5, 20, 23]. The 16 writes are split as follows [0, 0, 0, 2, 14].
[2024-11-24 02:01:24,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:24" (1/1) ...
[2024-11-24 02:01:24,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:24" (1/1) ...
[2024-11-24 02:01:24,905 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:24" (1/1) ...
[2024-11-24 02:01:24,906 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:24" (1/1) ...
[2024-11-24 02:01:24,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:24" (1/1) ...
[2024-11-24 02:01:24,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:24" (1/1) ...
[2024-11-24 02:01:24,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:24" (1/1) ...
[2024-11-24 02:01:24,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-24 02:01:24,934 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-24 02:01:24,934 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-24 02:01:24,934 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-24 02:01:24,935 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:24" (1/1) ...
[2024-11-24 02:01:24,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 02:01:24,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 02:01:24,975 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-24 02:01:24,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-24 02:01:25,008 INFO L130 BoogieDeclarations]: Found specification of procedure t1
[2024-11-24 02:01:25,008 INFO L138 BoogieDeclarations]: Found implementation of procedure t1
[2024-11-24 02:01:25,009 INFO L130 BoogieDeclarations]: Found specification of procedure t2
[2024-11-24 02:01:25,009 INFO L138 BoogieDeclarations]: Found implementation of procedure t2
[2024-11-24 02:01:25,009 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2024-11-24 02:01:25,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0
[2024-11-24 02:01:25,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1
[2024-11-24 02:01:25,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2
[2024-11-24 02:01:25,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3
[2024-11-24 02:01:25,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4
[2024-11-24 02:01:25,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0
[2024-11-24 02:01:25,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1
[2024-11-24 02:01:25,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2
[2024-11-24 02:01:25,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3
[2024-11-24 02:01:25,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4
[2024-11-24 02:01:25,010 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-11-24 02:01:25,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-24 02:01:25,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-24 02:01:25,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1
[2024-11-24 02:01:25,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2
[2024-11-24 02:01:25,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3
[2024-11-24 02:01:25,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4
[2024-11-24 02:01:25,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-24 02:01:25,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-24 02:01:25,013 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-24 02:01:25,247 INFO L234 CfgBuilder]: Building ICFG
[2024-11-24 02:01:25,249 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-24 02:01:26,307 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-24 02:01:26,308 INFO L283 CfgBuilder]: Performing block encoding
[2024-11-24 02:01:26,911 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-24 02:01:26,911 INFO L312 CfgBuilder]: Removed 2 assume(true) statements.
[2024-11-24 02:01:26,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 02:01:26 BoogieIcfgContainer
[2024-11-24 02:01:26,912 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-24 02:01:26,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-24 02:01:26,917 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-24 02:01:26,922 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-24 02:01:26,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 02:01:23" (1/3) ...
[2024-11-24 02:01:26,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9520de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 02:01:26, skipping insertion in model container
[2024-11-24 02:01:26,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:24" (2/3) ...
[2024-11-24 02:01:26,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9520de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 02:01:26, skipping insertion in model container
[2024-11-24 02:01:26,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 02:01:26" (3/3) ...
[2024-11-24 02:01:26,925 INFO L128 eAbstractionObserver]: Analyzing ICFG queue.i
[2024-11-24 02:01:26,942 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-24 02:01:26,944 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue.i that has 3 procedures, 159 locations, 1 initial locations, 2 loop locations, and 72 error locations.
[2024-11-24 02:01:26,944 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-24 02:01:27,116 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-11-24 02:01:27,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 172 transitions, 358 flow
[2024-11-24 02:01:27,297 INFO L124 PetriNetUnfolderBase]: 14/170 cut-off events.
[2024-11-24 02:01:27,303 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES.
[2024-11-24 02:01:27,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 170 events. 14/170 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 527 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 142. Up to 2 conditions per place.
[2024-11-24 02:01:27,315 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 172 transitions, 358 flow
[2024-11-24 02:01:27,329 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 169 transitions, 350 flow
[2024-11-24 02:01:27,347 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-24 02:01:27,369 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;@16031351, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-24 02:01:27,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 134 error locations.
[2024-11-24 02:01:27,380 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-24 02:01:27,380 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events.
[2024-11-24 02:01:27,380 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 02:01:27,380 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:01:27,381 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1]
[2024-11-24 02:01:27,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:01:27,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:01:27,389 INFO L85 PathProgramCache]: Analyzing trace with hash 25067, now seen corresponding path program 1 times
[2024-11-24 02:01:27,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:01:27,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089083077]
[2024-11-24 02:01:27,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:01:27,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:01:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:01:27,903 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-24 02:01:27,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:01:27,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089083077]
[2024-11-24 02:01:27,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089083077] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 02:01:27,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 02:01:27,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-24 02:01:27,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016004703]
[2024-11-24 02:01:27,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 02:01:27,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 02:01:27,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:01:27,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 02:01:27,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 02:01:28,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172
[2024-11-24 02:01:28,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 169 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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-24 02:01:28,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:01:28,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172
[2024-11-24 02:01:28,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:01:29,467 INFO L124 PetriNetUnfolderBase]: 1743/4598 cut-off events.
[2024-11-24 02:01:29,468 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES.
[2024-11-24 02:01:29,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7420 conditions, 4598 events. 1743/4598 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 36333 event pairs, 1390 based on Foata normal form. 184/3554 useless extension candidates. Maximal degree in co-relation 7305. Up to 2741 conditions per place.
[2024-11-24 02:01:29,524 INFO L140 encePairwiseOnDemand]: 162/172 looper letters, 57 selfloop transitions, 2 changer transitions 0/153 dead transitions.
[2024-11-24 02:01:29,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 153 transitions, 436 flow
[2024-11-24 02:01:29,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 02:01:29,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 02:01:29,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions.
[2024-11-24 02:01:29,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7054263565891473
[2024-11-24 02:01:29,555 INFO L175 Difference]: Start difference. First operand has 162 places, 169 transitions, 350 flow. Second operand 3 states and 364 transitions.
[2024-11-24 02:01:29,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 153 transitions, 436 flow
[2024-11-24 02:01:29,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 153 transitions, 428 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-11-24 02:01:29,572 INFO L231 Difference]: Finished difference. Result has 150 places, 153 transitions, 314 flow
[2024-11-24 02:01:29,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=150, PETRI_TRANSITIONS=153}
[2024-11-24 02:01:29,579 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -12 predicate places.
[2024-11-24 02:01:29,579 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 153 transitions, 314 flow
[2024-11-24 02:01:29,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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-24 02:01:29,580 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:01:29,580 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1]
[2024-11-24 02:01:29,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-24 02:01:29,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:01:29,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:01:29,582 INFO L85 PathProgramCache]: Analyzing trace with hash 25068, now seen corresponding path program 1 times
[2024-11-24 02:01:29,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:01:29,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637587719]
[2024-11-24 02:01:29,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:01:29,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:01:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:01:29,884 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-24 02:01:29,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:01:29,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637587719]
[2024-11-24 02:01:29,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637587719] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 02:01:29,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 02:01:29,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-24 02:01:29,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052937829]
[2024-11-24 02:01:29,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 02:01:29,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 02:01:29,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:01:29,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 02:01:29,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 02:01:30,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172
[2024-11-24 02:01:30,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 153 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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-24 02:01:30,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:01:30,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172
[2024-11-24 02:01:30,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:01:30,835 INFO L124 PetriNetUnfolderBase]: 1744/4649 cut-off events.
[2024-11-24 02:01:30,836 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES.
[2024-11-24 02:01:30,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7428 conditions, 4649 events. 1744/4649 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 36961 event pairs, 1393 based on Foata normal form. 3/3406 useless extension candidates. Maximal degree in co-relation 7417. Up to 2744 conditions per place.
[2024-11-24 02:01:30,873 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 57 selfloop transitions, 2 changer transitions 0/150 dead transitions.
[2024-11-24 02:01:30,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 150 transitions, 426 flow
[2024-11-24 02:01:30,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 02:01:30,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 02:01:30,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions.
[2024-11-24 02:01:30,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6957364341085271
[2024-11-24 02:01:30,878 INFO L175 Difference]: Start difference. First operand has 150 places, 153 transitions, 314 flow. Second operand 3 states and 359 transitions.
[2024-11-24 02:01:30,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 150 transitions, 426 flow
[2024-11-24 02:01:30,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 150 transitions, 422 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 02:01:30,885 INFO L231 Difference]: Finished difference. Result has 147 places, 150 transitions, 308 flow
[2024-11-24 02:01:30,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=147, PETRI_TRANSITIONS=150}
[2024-11-24 02:01:30,887 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -15 predicate places.
[2024-11-24 02:01:30,887 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 150 transitions, 308 flow
[2024-11-24 02:01:30,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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-24 02:01:30,888 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:01:30,888 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2024-11-24 02:01:30,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-24 02:01:30,888 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:01:30,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:01:30,889 INFO L85 PathProgramCache]: Analyzing trace with hash 747535161, now seen corresponding path program 1 times
[2024-11-24 02:01:30,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:01:30,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923865817]
[2024-11-24 02:01:30,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:01:30,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:01:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:01:31,090 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-24 02:01:31,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:01:31,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923865817]
[2024-11-24 02:01:31,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923865817] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 02:01:31,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 02:01:31,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 02:01:31,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488273912]
[2024-11-24 02:01:31,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 02:01:31,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 02:01:31,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:01:31,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 02:01:31,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-24 02:01:31,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172
[2024-11-24 02:01:31,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 150 transitions, 308 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 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-24 02:01:31,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:01:31,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172
[2024-11-24 02:01:31,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:01:32,013 INFO L124 PetriNetUnfolderBase]: 1744/4647 cut-off events.
[2024-11-24 02:01:32,013 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES.
[2024-11-24 02:01:32,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7426 conditions, 4647 events. 1744/4647 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 36978 event pairs, 1393 based on Foata normal form. 1/3404 useless extension candidates. Maximal degree in co-relation 7415. Up to 2743 conditions per place.
[2024-11-24 02:01:32,050 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 56 selfloop transitions, 3 changer transitions 0/148 dead transitions.
[2024-11-24 02:01:32,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 148 transitions, 422 flow
[2024-11-24 02:01:32,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-24 02:01:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-24 02:01:32,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 461 transitions.
[2024-11-24 02:01:32,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6700581395348837
[2024-11-24 02:01:32,052 INFO L175 Difference]: Start difference. First operand has 147 places, 150 transitions, 308 flow. Second operand 4 states and 461 transitions.
[2024-11-24 02:01:32,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 148 transitions, 422 flow
[2024-11-24 02:01:32,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 148 transitions, 418 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 02:01:32,060 INFO L231 Difference]: Finished difference. Result has 146 places, 148 transitions, 306 flow
[2024-11-24 02:01:32,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=306, PETRI_PLACES=146, PETRI_TRANSITIONS=148}
[2024-11-24 02:01:32,063 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -16 predicate places.
[2024-11-24 02:01:32,063 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 148 transitions, 306 flow
[2024-11-24 02:01:32,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 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-24 02:01:32,064 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:01:32,064 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2024-11-24 02:01:32,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-24 02:01:32,065 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:01:32,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:01:32,066 INFO L85 PathProgramCache]: Analyzing trace with hash 747535162, now seen corresponding path program 1 times
[2024-11-24 02:01:32,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:01:32,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976493578]
[2024-11-24 02:01:32,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:01:32,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:01:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:01:32,328 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-24 02:01:32,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:01:32,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976493578]
[2024-11-24 02:01:32,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976493578] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 02:01:32,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 02:01:32,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 02:01:32,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038921178]
[2024-11-24 02:01:32,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 02:01:32,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 02:01:32,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:01:32,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 02:01:32,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-24 02:01:32,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172
[2024-11-24 02:01:32,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 148 transitions, 306 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 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-24 02:01:32,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:01:32,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172
[2024-11-24 02:01:32,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:01:33,208 INFO L124 PetriNetUnfolderBase]: 1744/4645 cut-off events.
[2024-11-24 02:01:33,209 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES.
[2024-11-24 02:01:33,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7425 conditions, 4645 events. 1744/4645 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 36947 event pairs, 1393 based on Foata normal form. 2/3404 useless extension candidates. Maximal degree in co-relation 7410. Up to 2743 conditions per place.
[2024-11-24 02:01:33,238 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 56 selfloop transitions, 3 changer transitions 0/146 dead transitions.
[2024-11-24 02:01:33,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 146 transitions, 420 flow
[2024-11-24 02:01:33,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-24 02:01:33,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-24 02:01:33,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 461 transitions.
[2024-11-24 02:01:33,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6700581395348837
[2024-11-24 02:01:33,242 INFO L175 Difference]: Start difference. First operand has 146 places, 148 transitions, 306 flow. Second operand 4 states and 461 transitions.
[2024-11-24 02:01:33,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 146 transitions, 420 flow
[2024-11-24 02:01:33,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 146 transitions, 414 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-24 02:01:33,246 INFO L231 Difference]: Finished difference. Result has 144 places, 146 transitions, 302 flow
[2024-11-24 02:01:33,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=144, PETRI_TRANSITIONS=146}
[2024-11-24 02:01:33,248 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -18 predicate places.
[2024-11-24 02:01:33,248 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 146 transitions, 302 flow
[2024-11-24 02:01:33,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 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-24 02:01:33,249 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:01:33,249 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 02:01:33,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-24 02:01:33,249 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:01:33,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:01:33,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1698785404, now seen corresponding path program 1 times
[2024-11-24 02:01:33,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:01:33,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065297948]
[2024-11-24 02:01:33,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:01:33,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:01:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:01:33,465 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-24 02:01:33,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:01:33,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065297948]
[2024-11-24 02:01:33,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065297948] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 02:01:33,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 02:01:33,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 02:01:33,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273562982]
[2024-11-24 02:01:33,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 02:01:33,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 02:01:33,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:01:33,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 02:01:33,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-24 02:01:33,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 172
[2024-11-24 02:01:33,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 146 transitions, 302 flow. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 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-24 02:01:33,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:01:33,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 172
[2024-11-24 02:01:33,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:01:34,455 INFO L124 PetriNetUnfolderBase]: 1703/4144 cut-off events.
[2024-11-24 02:01:34,455 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES.
[2024-11-24 02:01:34,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6880 conditions, 4144 events. 1703/4144 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 30712 event pairs, 702 based on Foata normal form. 204/3608 useless extension candidates. Maximal degree in co-relation 6865. Up to 1413 conditions per place.
[2024-11-24 02:01:34,484 INFO L140 encePairwiseOnDemand]: 151/172 looper letters, 73 selfloop transitions, 5 changer transitions 0/149 dead transitions.
[2024-11-24 02:01:34,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 149 transitions, 465 flow
[2024-11-24 02:01:34,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-24 02:01:34,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-24 02:01:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 438 transitions.
[2024-11-24 02:01:34,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6366279069767442
[2024-11-24 02:01:34,489 INFO L175 Difference]: Start difference. First operand has 144 places, 146 transitions, 302 flow. Second operand 4 states and 438 transitions.
[2024-11-24 02:01:34,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 149 transitions, 465 flow
[2024-11-24 02:01:34,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 149 transitions, 459 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-24 02:01:34,499 INFO L231 Difference]: Finished difference. Result has 128 places, 130 transitions, 274 flow
[2024-11-24 02:01:34,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=274, PETRI_PLACES=128, PETRI_TRANSITIONS=130}
[2024-11-24 02:01:34,500 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -34 predicate places.
[2024-11-24 02:01:34,501 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 130 transitions, 274 flow
[2024-11-24 02:01:34,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 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-24 02:01:34,501 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:01:34,501 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 02:01:34,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-24 02:01:34,501 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:01:34,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:01:34,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1698785403, now seen corresponding path program 1 times
[2024-11-24 02:01:34,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:01:34,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563007650]
[2024-11-24 02:01:34,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:01:34,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:01:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:01:34,808 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-24 02:01:34,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:01:34,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563007650]
[2024-11-24 02:01:34,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563007650] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 02:01:34,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 02:01:34,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 02:01:34,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281922438]
[2024-11-24 02:01:34,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 02:01:34,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 02:01:34,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:01:34,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 02:01:34,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-24 02:01:35,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 172
[2024-11-24 02:01:35,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 130 transitions, 274 flow. Second operand has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 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-24 02:01:35,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:01:35,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 172
[2024-11-24 02:01:35,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:01:35,589 INFO L124 PetriNetUnfolderBase]: 1703/3675 cut-off events.
[2024-11-24 02:01:35,589 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES.
[2024-11-24 02:01:35,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6545 conditions, 3675 events. 1703/3675 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 24488 event pairs, 702 based on Foata normal form. 204/3340 useless extension candidates. Maximal degree in co-relation 2518. Up to 1413 conditions per place.
[2024-11-24 02:01:35,609 INFO L140 encePairwiseOnDemand]: 153/172 looper letters, 73 selfloop transitions, 5 changer transitions 0/135 dead transitions.
[2024-11-24 02:01:35,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 135 transitions, 441 flow
[2024-11-24 02:01:35,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-24 02:01:35,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-24 02:01:35,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 444 transitions.
[2024-11-24 02:01:35,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6453488372093024
[2024-11-24 02:01:35,613 INFO L175 Difference]: Start difference. First operand has 128 places, 130 transitions, 274 flow. Second operand 4 states and 444 transitions.
[2024-11-24 02:01:35,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 135 transitions, 441 flow
[2024-11-24 02:01:35,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 135 transitions, 431 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-24 02:01:35,617 INFO L231 Difference]: Finished difference. Result has 114 places, 116 transitions, 246 flow
[2024-11-24 02:01:35,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=246, PETRI_PLACES=114, PETRI_TRANSITIONS=116}
[2024-11-24 02:01:35,618 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -48 predicate places.
[2024-11-24 02:01:35,618 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 116 transitions, 246 flow
[2024-11-24 02:01:35,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 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-24 02:01:35,619 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:01:35,619 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 02:01:35,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-24 02:01:35,619 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:01:35,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:01:35,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1122739101, now seen corresponding path program 1 times
[2024-11-24 02:01:35,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:01:35,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549153286]
[2024-11-24 02:01:35,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:01:35,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:01:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:01:36,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 02:01:36,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:01:36,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549153286]
[2024-11-24 02:01:36,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549153286] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 02:01:36,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 02:01:36,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 02:01:36,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72566305]
[2024-11-24 02:01:36,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 02:01:36,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-24 02:01:36,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:01:36,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-24 02:01:36,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-11-24 02:01:37,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 172
[2024-11-24 02:01:37,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 116 transitions, 246 flow. Second operand has 7 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 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-24 02:01:37,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:01:37,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 172
[2024-11-24 02:01:37,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:01:38,247 INFO L124 PetriNetUnfolderBase]: 2502/5391 cut-off events.
[2024-11-24 02:01:38,247 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES.
[2024-11-24 02:01:38,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9547 conditions, 5391 events. 2502/5391 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 38805 event pairs, 536 based on Foata normal form. 0/4393 useless extension candidates. Maximal degree in co-relation 3717. Up to 3436 conditions per place.
[2024-11-24 02:01:38,271 INFO L140 encePairwiseOnDemand]: 163/172 looper letters, 124 selfloop transitions, 11 changer transitions 0/183 dead transitions.
[2024-11-24 02:01:38,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 183 transitions, 655 flow
[2024-11-24 02:01:38,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-24 02:01:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-24 02:01:38,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 669 transitions.
[2024-11-24 02:01:38,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5556478405315615
[2024-11-24 02:01:38,274 INFO L175 Difference]: Start difference. First operand has 114 places, 116 transitions, 246 flow. Second operand 7 states and 669 transitions.
[2024-11-24 02:01:38,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 183 transitions, 655 flow
[2024-11-24 02:01:38,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 183 transitions, 643 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-24 02:01:38,281 INFO L231 Difference]: Finished difference. Result has 121 places, 126 transitions, 310 flow
[2024-11-24 02:01:38,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=310, PETRI_PLACES=121, PETRI_TRANSITIONS=126}
[2024-11-24 02:01:38,282 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -41 predicate places.
[2024-11-24 02:01:38,282 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 126 transitions, 310 flow
[2024-11-24 02:01:38,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 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-24 02:01:38,283 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:01:38,283 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 02:01:38,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-24 02:01:38,283 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:01:38,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:01:38,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1732594826, now seen corresponding path program 1 times
[2024-11-24 02:01:38,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:01:38,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524928018]
[2024-11-24 02:01:38,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:01:38,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:01:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:01:38,427 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-24 02:01:38,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:01:38,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524928018]
[2024-11-24 02:01:38,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524928018] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 02:01:38,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 02:01:38,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 02:01:38,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893877681]
[2024-11-24 02:01:38,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 02:01:38,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 02:01:38,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:01:38,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 02:01:38,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 02:01:38,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172
[2024-11-24 02:01:38,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 126 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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-24 02:01:38,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:01:38,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172
[2024-11-24 02:01:38,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:01:38,930 INFO L124 PetriNetUnfolderBase]: 1382/3218 cut-off events.
[2024-11-24 02:01:38,931 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES.
[2024-11-24 02:01:38,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5612 conditions, 3218 events. 1382/3218 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 19654 event pairs, 703 based on Foata normal form. 55/2726 useless extension candidates. Maximal degree in co-relation 5605. Up to 1211 conditions per place.
[2024-11-24 02:01:38,950 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 80 selfloop transitions, 3 changer transitions 0/139 dead transitions.
[2024-11-24 02:01:38,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 139 transitions, 476 flow
[2024-11-24 02:01:38,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 02:01:38,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 02:01:38,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions.
[2024-11-24 02:01:38,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7558139534883721
[2024-11-24 02:01:38,952 INFO L175 Difference]: Start difference. First operand has 121 places, 126 transitions, 310 flow. Second operand 3 states and 390 transitions.
[2024-11-24 02:01:38,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 139 transitions, 476 flow
[2024-11-24 02:01:38,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 139 transitions, 451 flow, removed 1 selfloop flow, removed 8 redundant places.
[2024-11-24 02:01:38,961 INFO L231 Difference]: Finished difference. Result has 114 places, 116 transitions, 249 flow
[2024-11-24 02:01:38,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=249, PETRI_PLACES=114, PETRI_TRANSITIONS=116}
[2024-11-24 02:01:38,965 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -48 predicate places.
[2024-11-24 02:01:38,965 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 116 transitions, 249 flow
[2024-11-24 02:01:38,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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-24 02:01:38,965 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:01:38,965 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]
[2024-11-24 02:01:38,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-24 02:01:38,966 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:01:38,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:01:38,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1461278638, now seen corresponding path program 1 times
[2024-11-24 02:01:38,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:01:38,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961869105]
[2024-11-24 02:01:38,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:01:38,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:01:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:01:39,123 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-24 02:01:39,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:01:39,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961869105]
[2024-11-24 02:01:39,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961869105] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 02:01:39,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 02:01:39,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-24 02:01:39,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037731023]
[2024-11-24 02:01:39,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 02:01:39,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 02:01:39,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:01:39,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 02:01:39,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 02:01:39,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172
[2024-11-24 02:01:39,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 116 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-24 02:01:39,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:01:39,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172
[2024-11-24 02:01:39,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:01:39,716 INFO L124 PetriNetUnfolderBase]: 1392/3289 cut-off events.
[2024-11-24 02:01:39,716 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES.
[2024-11-24 02:01:39,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5671 conditions, 3289 events. 1392/3289 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 20432 event pairs, 1089 based on Foata normal form. 77/2806 useless extension candidates. Maximal degree in co-relation 5666. Up to 2215 conditions per place.
[2024-11-24 02:01:39,732 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 59 selfloop transitions, 1 changer transitions 0/113 dead transitions.
[2024-11-24 02:01:39,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 113 transitions, 363 flow
[2024-11-24 02:01:39,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 02:01:39,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 02:01:39,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions.
[2024-11-24 02:01:39,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6957364341085271
[2024-11-24 02:01:39,734 INFO L175 Difference]: Start difference. First operand has 114 places, 116 transitions, 249 flow. Second operand 3 states and 359 transitions.
[2024-11-24 02:01:39,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 113 transitions, 363 flow
[2024-11-24 02:01:39,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 113 transitions, 360 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-24 02:01:39,739 INFO L231 Difference]: Finished difference. Result has 112 places, 113 transitions, 242 flow
[2024-11-24 02:01:39,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=112, PETRI_TRANSITIONS=113}
[2024-11-24 02:01:39,740 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -50 predicate places.
[2024-11-24 02:01:39,740 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 113 transitions, 242 flow
[2024-11-24 02:01:39,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-24 02:01:39,740 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:01:39,740 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]
[2024-11-24 02:01:39,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-24 02:01:39,741 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:01:39,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:01:39,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1461278637, now seen corresponding path program 1 times
[2024-11-24 02:01:39,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:01:39,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525740049]
[2024-11-24 02:01:39,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:01:39,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:01:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:01:39,949 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-24 02:01:39,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:01:39,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525740049]
[2024-11-24 02:01:39,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525740049] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 02:01:39,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 02:01:39,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-24 02:01:39,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381921587]
[2024-11-24 02:01:39,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 02:01:39,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 02:01:39,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:01:39,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 02:01:39,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 02:01:40,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172
[2024-11-24 02:01:40,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 113 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-24 02:01:40,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:01:40,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172
[2024-11-24 02:01:40,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:01:40,491 INFO L124 PetriNetUnfolderBase]: 1392/3277 cut-off events.
[2024-11-24 02:01:40,491 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES.
[2024-11-24 02:01:40,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5646 conditions, 3277 events. 1392/3277 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 20326 event pairs, 1089 based on Foata normal form. 0/2717 useless extension candidates. Maximal degree in co-relation 5641. Up to 2215 conditions per place.
[2024-11-24 02:01:40,508 INFO L140 encePairwiseOnDemand]: 170/172 looper letters, 59 selfloop transitions, 1 changer transitions 0/112 dead transitions.
[2024-11-24 02:01:40,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 112 transitions, 360 flow
[2024-11-24 02:01:40,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 02:01:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 02:01:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions.
[2024-11-24 02:01:40,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7034883720930233
[2024-11-24 02:01:40,511 INFO L175 Difference]: Start difference. First operand has 112 places, 113 transitions, 242 flow. Second operand 3 states and 363 transitions.
[2024-11-24 02:01:40,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 112 transitions, 360 flow
[2024-11-24 02:01:40,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 112 transitions, 359 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-24 02:01:40,513 INFO L231 Difference]: Finished difference. Result has 112 places, 112 transitions, 241 flow
[2024-11-24 02:01:40,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=241, PETRI_PLACES=112, PETRI_TRANSITIONS=112}
[2024-11-24 02:01:40,514 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -50 predicate places.
[2024-11-24 02:01:40,514 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 112 transitions, 241 flow
[2024-11-24 02:01:40,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-24 02:01:40,515 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:01:40,515 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-24 02:01:40,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-24 02:01:40,516 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:01:40,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:01:40,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1945003474, now seen corresponding path program 1 times
[2024-11-24 02:01:40,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:01:40,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555211530]
[2024-11-24 02:01:40,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:01:40,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:01:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:01:40,668 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-24 02:01:40,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:01:40,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555211530]
[2024-11-24 02:01:40,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555211530] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 02:01:40,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 02:01:40,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 02:01:40,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061152587]
[2024-11-24 02:01:40,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 02:01:40,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 02:01:40,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:01:40,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 02:01:40,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-24 02:01:40,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172
[2024-11-24 02:01:40,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 112 transitions, 241 flow. Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 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-24 02:01:40,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:01:40,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172
[2024-11-24 02:01:40,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:01:41,398 INFO L124 PetriNetUnfolderBase]: 1392/3253 cut-off events.
[2024-11-24 02:01:41,398 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES.
[2024-11-24 02:01:41,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5623 conditions, 3253 events. 1392/3253 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 20057 event pairs, 1074 based on Foata normal form. 12/2729 useless extension candidates. Maximal degree in co-relation 5618. Up to 2186 conditions per place.
[2024-11-24 02:01:41,416 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 65 selfloop transitions, 3 changer transitions 0/118 dead transitions.
[2024-11-24 02:01:41,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 118 transitions, 390 flow
[2024-11-24 02:01:41,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-24 02:01:41,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-24 02:01:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 469 transitions.
[2024-11-24 02:01:41,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6816860465116279
[2024-11-24 02:01:41,419 INFO L175 Difference]: Start difference. First operand has 112 places, 112 transitions, 241 flow. Second operand 4 states and 469 transitions.
[2024-11-24 02:01:41,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 118 transitions, 390 flow
[2024-11-24 02:01:41,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 118 transitions, 389 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-24 02:01:41,421 INFO L231 Difference]: Finished difference. Result has 112 places, 110 transitions, 242 flow
[2024-11-24 02:01:41,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=242, PETRI_PLACES=112, PETRI_TRANSITIONS=110}
[2024-11-24 02:01:41,422 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -50 predicate places.
[2024-11-24 02:01:41,423 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 110 transitions, 242 flow
[2024-11-24 02:01:41,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 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-24 02:01:41,423 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:01:41,423 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-24 02:01:41,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-24 02:01:41,423 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:01:41,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:01:41,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1945003475, now seen corresponding path program 1 times
[2024-11-24 02:01:41,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:01:41,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921918023]
[2024-11-24 02:01:41,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:01:41,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:01:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:01:41,673 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-24 02:01:41,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:01:41,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921918023]
[2024-11-24 02:01:41,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921918023] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 02:01:41,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 02:01:41,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 02:01:41,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201433301]
[2024-11-24 02:01:41,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 02:01:41,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 02:01:41,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:01:41,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 02:01:41,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-24 02:01:41,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172
[2024-11-24 02:01:41,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 110 transitions, 242 flow. Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 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-24 02:01:41,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:01:41,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172
[2024-11-24 02:01:41,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:01:42,398 INFO L124 PetriNetUnfolderBase]: 1392/3229 cut-off events.
[2024-11-24 02:01:42,398 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES.
[2024-11-24 02:01:42,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5624 conditions, 3229 events. 1392/3229 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 19781 event pairs, 1074 based on Foata normal form. 24/2729 useless extension candidates. Maximal degree in co-relation 5619. Up to 2186 conditions per place.
[2024-11-24 02:01:42,415 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 65 selfloop transitions, 3 changer transitions 0/116 dead transitions.
[2024-11-24 02:01:42,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 116 transitions, 391 flow
[2024-11-24 02:01:42,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-24 02:01:42,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-24 02:01:42,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 469 transitions.
[2024-11-24 02:01:42,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6816860465116279
[2024-11-24 02:01:42,418 INFO L175 Difference]: Start difference. First operand has 112 places, 110 transitions, 242 flow. Second operand 4 states and 469 transitions.
[2024-11-24 02:01:42,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 116 transitions, 391 flow
[2024-11-24 02:01:42,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 116 transitions, 385 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-24 02:01:42,422 INFO L231 Difference]: Finished difference. Result has 110 places, 108 transitions, 238 flow
[2024-11-24 02:01:42,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=238, PETRI_PLACES=110, PETRI_TRANSITIONS=108}
[2024-11-24 02:01:42,423 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -52 predicate places.
[2024-11-24 02:01:42,424 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 108 transitions, 238 flow
[2024-11-24 02:01:42,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 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-24 02:01:42,425 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:01:42,425 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-24 02:01:42,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-24 02:01:42,426 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:01:42,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:01:42,426 INFO L85 PathProgramCache]: Analyzing trace with hash 165533751, now seen corresponding path program 1 times
[2024-11-24 02:01:42,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:01:42,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207453319]
[2024-11-24 02:01:42,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:01:42,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:01:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:01:42,513 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-24 02:01:42,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:01:42,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207453319]
[2024-11-24 02:01:42,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207453319] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 02:01:42,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 02:01:42,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 02:01:42,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902995119]
[2024-11-24 02:01:42,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 02:01:42,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 02:01:42,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:01:42,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 02:01:42,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 02:01:42,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172
[2024-11-24 02:01:42,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 108 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-24 02:01:42,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:01:42,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172
[2024-11-24 02:01:42,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:01:42,986 INFO L124 PetriNetUnfolderBase]: 1380/3217 cut-off events.
[2024-11-24 02:01:42,987 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES.
[2024-11-24 02:01:42,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5600 conditions, 3217 events. 1380/3217 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 19794 event pairs, 1074 based on Foata normal form. 0/2705 useless extension candidates. Maximal degree in co-relation 5595. Up to 2175 conditions per place.
[2024-11-24 02:01:43,005 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 65 selfloop transitions, 2 changer transitions 0/115 dead transitions.
[2024-11-24 02:01:43,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 115 transitions, 387 flow
[2024-11-24 02:01:43,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 02:01:43,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 02:01:43,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions.
[2024-11-24 02:01:43,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7228682170542635
[2024-11-24 02:01:43,008 INFO L175 Difference]: Start difference. First operand has 110 places, 108 transitions, 238 flow. Second operand 3 states and 373 transitions.
[2024-11-24 02:01:43,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 115 transitions, 387 flow
[2024-11-24 02:01:43,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 115 transitions, 381 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-24 02:01:43,011 INFO L231 Difference]: Finished difference. Result has 109 places, 107 transitions, 234 flow
[2024-11-24 02:01:43,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=109, PETRI_TRANSITIONS=107}
[2024-11-24 02:01:43,013 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -53 predicate places.
[2024-11-24 02:01:43,013 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 107 transitions, 234 flow
[2024-11-24 02:01:43,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-24 02:01:43,014 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:01:43,014 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]
[2024-11-24 02:01:43,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-11-24 02:01:43,014 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:01:43,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:01:43,015 INFO L85 PathProgramCache]: Analyzing trace with hash -998985647, now seen corresponding path program 1 times
[2024-11-24 02:01:43,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:01:43,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825871212]
[2024-11-24 02:01:43,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:01:43,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:01:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:01:44,646 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-24 02:01:44,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:01:44,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825871212]
[2024-11-24 02:01:44,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825871212] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 02:01:44,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 02:01:44,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2024-11-24 02:01:44,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164850549]
[2024-11-24 02:01:44,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 02:01:44,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-11-24 02:01:44,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:01:44,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-11-24 02:01:44,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182
[2024-11-24 02:01:46,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 172
[2024-11-24 02:01:46,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 107 transitions, 234 flow. Second operand has 14 states, 14 states have (on average 94.57142857142857) internal successors, (1324), 14 states have internal predecessors, (1324), 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-24 02:01:46,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:01:46,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 172
[2024-11-24 02:01:46,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:01:47,587 INFO L124 PetriNetUnfolderBase]: 1847/4004 cut-off events.
[2024-11-24 02:01:47,587 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES.
[2024-11-24 02:01:47,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7252 conditions, 4004 events. 1847/4004 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 24540 event pairs, 382 based on Foata normal form. 0/3520 useless extension candidates. Maximal degree in co-relation 7247. Up to 2245 conditions per place.
[2024-11-24 02:01:47,605 INFO L140 encePairwiseOnDemand]: 158/172 looper letters, 143 selfloop transitions, 14 changer transitions 0/196 dead transitions.
[2024-11-24 02:01:47,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 196 transitions, 741 flow
[2024-11-24 02:01:47,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2024-11-24 02:01:47,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2024-11-24 02:01:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1366 transitions.
[2024-11-24 02:01:47,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.610912343470483
[2024-11-24 02:01:47,611 INFO L175 Difference]: Start difference. First operand has 109 places, 107 transitions, 234 flow. Second operand 13 states and 1366 transitions.
[2024-11-24 02:01:47,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 196 transitions, 741 flow
[2024-11-24 02:01:47,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 196 transitions, 733 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 02:01:47,617 INFO L231 Difference]: Finished difference. Result has 123 places, 113 transitions, 292 flow
[2024-11-24 02:01:47,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=292, PETRI_PLACES=123, PETRI_TRANSITIONS=113}
[2024-11-24 02:01:47,619 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -39 predicate places.
[2024-11-24 02:01:47,619 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 113 transitions, 292 flow
[2024-11-24 02:01:47,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 94.57142857142857) internal successors, (1324), 14 states have internal predecessors, (1324), 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-24 02:01:47,621 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:01:47,621 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-24 02:01:47,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-11-24 02:01:47,621 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:01:47,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:01:47,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1709015627, now seen corresponding path program 1 times
[2024-11-24 02:01:47,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:01:47,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086878866]
[2024-11-24 02:01:47,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:01:47,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:01:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:01:49,354 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-24 02:01:49,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:01:49,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086878866]
[2024-11-24 02:01:49,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086878866] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 02:01:49,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 02:01:49,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2024-11-24 02:01:49,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578172161]
[2024-11-24 02:01:49,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 02:01:49,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-11-24 02:01:49,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:01:49,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-11-24 02:01:49,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182
[2024-11-24 02:01:51,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 172
[2024-11-24 02:01:51,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 113 transitions, 292 flow. Second operand has 14 states, 14 states have (on average 94.64285714285714) internal successors, (1325), 14 states have internal predecessors, (1325), 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-24 02:01:51,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:01:51,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 172
[2024-11-24 02:01:51,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:01:52,410 INFO L124 PetriNetUnfolderBase]: 1918/4006 cut-off events.
[2024-11-24 02:01:52,410 INFO L125 PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES.
[2024-11-24 02:01:52,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7615 conditions, 4006 events. 1918/4006 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 23825 event pairs, 434 based on Foata normal form. 0/3604 useless extension candidates. Maximal degree in co-relation 7606. Up to 1950 conditions per place.
[2024-11-24 02:01:52,428 INFO L140 encePairwiseOnDemand]: 157/172 looper letters, 127 selfloop transitions, 19 changer transitions 0/182 dead transitions.
[2024-11-24 02:01:52,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 182 transitions, 732 flow
[2024-11-24 02:01:52,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-11-24 02:01:52,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-11-24 02:01:52,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1256 transitions.
[2024-11-24 02:01:52,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6085271317829457
[2024-11-24 02:01:52,433 INFO L175 Difference]: Start difference. First operand has 123 places, 113 transitions, 292 flow. Second operand 12 states and 1256 transitions.
[2024-11-24 02:01:52,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 182 transitions, 732 flow
[2024-11-24 02:01:52,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 182 transitions, 719 flow, removed 0 selfloop flow, removed 6 redundant places.
[2024-11-24 02:01:52,438 INFO L231 Difference]: Finished difference. Result has 125 places, 110 transitions, 321 flow
[2024-11-24 02:01:52,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=321, PETRI_PLACES=125, PETRI_TRANSITIONS=110}
[2024-11-24 02:01:52,439 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -37 predicate places.
[2024-11-24 02:01:52,439 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 110 transitions, 321 flow
[2024-11-24 02:01:52,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 94.64285714285714) internal successors, (1325), 14 states have internal predecessors, (1325), 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-24 02:01:52,440 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:01:52,440 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]
[2024-11-24 02:01:52,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-11-24 02:01:52,441 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:01:52,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:01:52,441 INFO L85 PathProgramCache]: Analyzing trace with hash -789673090, now seen corresponding path program 1 times
[2024-11-24 02:01:52,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:01:52,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413927606]
[2024-11-24 02:01:52,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:01:52,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:01:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:01:52,915 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-24 02:01:52,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:01:52,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413927606]
[2024-11-24 02:01:52,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413927606] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 02:01:52,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 02:01:52,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 02:01:52,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256375143]
[2024-11-24 02:01:52,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 02:01:52,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-24 02:01:52,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:01:52,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-24 02:01:52,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-11-24 02:01:53,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 172
[2024-11-24 02:01:53,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 110 transitions, 321 flow. Second operand has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 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-24 02:01:53,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:01:53,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 172
[2024-11-24 02:01:53,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:01:54,865 INFO L124 PetriNetUnfolderBase]: 3132/6246 cut-off events.
[2024-11-24 02:01:54,865 INFO L125 PetriNetUnfolderBase]: For 507/507 co-relation queries the response was YES.
[2024-11-24 02:01:54,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12286 conditions, 6246 events. 3132/6246 cut-off events. For 507/507 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 39381 event pairs, 536 based on Foata normal form. 80/5731 useless extension candidates. Maximal degree in co-relation 12276. Up to 1657 conditions per place.
[2024-11-24 02:01:54,904 INFO L140 encePairwiseOnDemand]: 159/172 looper letters, 167 selfloop transitions, 21 changer transitions 0/226 dead transitions.
[2024-11-24 02:01:54,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 226 transitions, 965 flow
[2024-11-24 02:01:54,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-24 02:01:54,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-24 02:01:54,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 818 transitions.
[2024-11-24 02:01:54,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5944767441860465
[2024-11-24 02:01:54,908 INFO L175 Difference]: Start difference. First operand has 125 places, 110 transitions, 321 flow. Second operand 8 states and 818 transitions.
[2024-11-24 02:01:54,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 226 transitions, 965 flow
[2024-11-24 02:01:54,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 226 transitions, 929 flow, removed 3 selfloop flow, removed 10 redundant places.
[2024-11-24 02:01:54,916 INFO L231 Difference]: Finished difference. Result has 127 places, 124 transitions, 419 flow
[2024-11-24 02:01:54,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=419, PETRI_PLACES=127, PETRI_TRANSITIONS=124}
[2024-11-24 02:01:54,918 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -35 predicate places.
[2024-11-24 02:01:54,918 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 124 transitions, 419 flow
[2024-11-24 02:01:54,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 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-24 02:01:54,919 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:01:54,919 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-24 02:01:54,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-11-24 02:01:54,920 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:01:54,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:01:54,921 INFO L85 PathProgramCache]: Analyzing trace with hash 536602052, now seen corresponding path program 1 times
[2024-11-24 02:01:54,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:01:54,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242677640]
[2024-11-24 02:01:54,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:01:54,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:01:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:01:55,889 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-24 02:01:55,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:01:55,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242677640]
[2024-11-24 02:01:55,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242677640] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-24 02:01:55,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872743778]
[2024-11-24 02:01:55,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:01:55,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 02:01:55,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 02:01:55,895 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 02:01:55,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-24 02:01:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:01:56,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 49 conjuncts are in the unsatisfiable core
[2024-11-24 02:01:56,089 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 02:01:56,192 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-24 02:01:56,243 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-24 02:01:56,465 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-24 02:01:56,466 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-24 02:01:56,512 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-24 02:01:56,622 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-24 02:01:56,837 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-24 02:01:56,838 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-24 02:02:01,188 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= (+ (* (select (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= 0 (+ (* (select (select (store |c_#memory_int#4| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false
[2024-11-24 02:02:31,954 INFO L349 Elim1Store]: treesize reduction 47, result has 52.5 percent of original size
[2024-11-24 02:02:31,955 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 116 treesize of output 146
[2024-11-24 02:02:31,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-24 02:02:31,996 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 111 treesize of output 111
[2024-11-24 02:02:32,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4
[2024-11-24 02:02:32,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-24 02:02:32,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 50
[2024-11-24 02:02:32,322 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-24 02:02:32,326 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-24 02:02:32,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-24 02:02:32,348 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-24 02:02:32,362 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-24 02:02:32,369 INFO L173 IndexEqualityManager]: detected equality via solver
[2024-11-24 02:02:32,376 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-24 02:02:32,377 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-24 02:02:32,542 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-24 02:02:32,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872743778] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-24 02:02:32,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-24 02:02:32,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 29
[2024-11-24 02:02:32,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197239883]
[2024-11-24 02:02:32,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-24 02:02:32,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states
[2024-11-24 02:02:32,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:02:32,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2024-11-24 02:02:32,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=725, Unknown=7, NotChecked=56, Total=930
[2024-11-24 02:02:33,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 172
[2024-11-24 02:02:33,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 124 transitions, 419 flow. Second operand has 31 states, 31 states have (on average 37.0) internal successors, (1147), 31 states have internal predecessors, (1147), 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-24 02:02:33,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:02:33,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 172
[2024-11-24 02:02:33,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:02:43,697 INFO L124 PetriNetUnfolderBase]: 6925/12298 cut-off events.
[2024-11-24 02:02:43,698 INFO L125 PetriNetUnfolderBase]: For 3209/3209 co-relation queries the response was YES.
[2024-11-24 02:02:43,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27619 conditions, 12298 events. 6925/12298 cut-off events. For 3209/3209 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 78428 event pairs, 957 based on Foata normal form. 98/11241 useless extension candidates. Maximal degree in co-relation 27604. Up to 6761 conditions per place.
[2024-11-24 02:02:43,758 INFO L140 encePairwiseOnDemand]: 153/172 looper letters, 338 selfloop transitions, 43 changer transitions 0/400 dead transitions.
[2024-11-24 02:02:43,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 400 transitions, 1893 flow
[2024-11-24 02:02:43,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2024-11-24 02:02:43,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states.
[2024-11-24 02:02:43,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 934 transitions.
[2024-11-24 02:02:43,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31942544459644323
[2024-11-24 02:02:43,763 INFO L175 Difference]: Start difference. First operand has 127 places, 124 transitions, 419 flow. Second operand 17 states and 934 transitions.
[2024-11-24 02:02:43,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 400 transitions, 1893 flow
[2024-11-24 02:02:43,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 400 transitions, 1888 flow, removed 2 selfloop flow, removed 1 redundant places.
[2024-11-24 02:02:43,782 INFO L231 Difference]: Finished difference. Result has 151 places, 159 transitions, 787 flow
[2024-11-24 02:02:43,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=787, PETRI_PLACES=151, PETRI_TRANSITIONS=159}
[2024-11-24 02:02:43,783 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -11 predicate places.
[2024-11-24 02:02:43,783 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 159 transitions, 787 flow
[2024-11-24 02:02:43,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 37.0) internal successors, (1147), 31 states have internal predecessors, (1147), 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-24 02:02:43,784 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:02:43,784 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, 1, 1, 1]
[2024-11-24 02:02:43,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-11-24 02:02:43,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2024-11-24 02:02:43,985 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:02:43,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:02:43,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1218977917, now seen corresponding path program 1 times
[2024-11-24 02:02:43,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:02:43,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587165399]
[2024-11-24 02:02:43,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:02:43,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:02:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:02:44,069 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2024-11-24 02:02:44,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:02:44,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587165399]
[2024-11-24 02:02:44,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587165399] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 02:02:44,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 02:02:44,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 02:02:44,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129270097]
[2024-11-24 02:02:44,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 02:02:44,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 02:02:44,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:02:44,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 02:02:44,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 02:02:44,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172
[2024-11-24 02:02:44,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 159 transitions, 787 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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-24 02:02:44,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:02:44,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172
[2024-11-24 02:02:44,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:02:46,334 INFO L124 PetriNetUnfolderBase]: 6337/14534 cut-off events.
[2024-11-24 02:02:46,334 INFO L125 PetriNetUnfolderBase]: For 9281/9423 co-relation queries the response was YES.
[2024-11-24 02:02:46,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31827 conditions, 14534 events. 6337/14534 cut-off events. For 9281/9423 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 124447 event pairs, 3063 based on Foata normal form. 276/12915 useless extension candidates. Maximal degree in co-relation 31803. Up to 5981 conditions per place.
[2024-11-24 02:02:46,420 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 174 selfloop transitions, 2 changer transitions 0/242 dead transitions.
[2024-11-24 02:02:46,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 242 transitions, 1608 flow
[2024-11-24 02:02:46,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 02:02:46,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 02:02:46,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions.
[2024-11-24 02:02:46,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7965116279069767
[2024-11-24 02:02:46,423 INFO L175 Difference]: Start difference. First operand has 151 places, 159 transitions, 787 flow. Second operand 3 states and 411 transitions.
[2024-11-24 02:02:46,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 242 transitions, 1608 flow
[2024-11-24 02:02:46,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 242 transitions, 1522 flow, removed 33 selfloop flow, removed 5 redundant places.
[2024-11-24 02:02:46,465 INFO L231 Difference]: Finished difference. Result has 149 places, 160 transitions, 734 flow
[2024-11-24 02:02:46,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=149, PETRI_TRANSITIONS=160}
[2024-11-24 02:02:46,466 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -13 predicate places.
[2024-11-24 02:02:46,466 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 160 transitions, 734 flow
[2024-11-24 02:02:46,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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-24 02:02:46,467 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:02:46,467 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, 1, 1, 1, 1, 1]
[2024-11-24 02:02:46,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-11-24 02:02:46,467 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:02:46,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:02:46,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1491146860, now seen corresponding path program 1 times
[2024-11-24 02:02:46,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:02:46,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561200733]
[2024-11-24 02:02:46,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:02:46,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:02:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:02:46,744 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2024-11-24 02:02:46,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:02:46,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561200733]
[2024-11-24 02:02:46,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561200733] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 02:02:46,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 02:02:46,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 02:02:46,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716916073]
[2024-11-24 02:02:46,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 02:02:46,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 02:02:46,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:02:46,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 02:02:46,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-24 02:02:47,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172
[2024-11-24 02:02:47,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 160 transitions, 734 flow. Second operand has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 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-24 02:02:47,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:02:47,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172
[2024-11-24 02:02:47,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:02:49,593 INFO L124 PetriNetUnfolderBase]: 7857/15567 cut-off events.
[2024-11-24 02:02:49,593 INFO L125 PetriNetUnfolderBase]: For 10512/10606 co-relation queries the response was YES.
[2024-11-24 02:02:49,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37921 conditions, 15567 events. 7857/15567 cut-off events. For 10512/10606 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 120207 event pairs, 4553 based on Foata normal form. 116/14530 useless extension candidates. Maximal degree in co-relation 37895. Up to 10714 conditions per place.
[2024-11-24 02:02:49,675 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 130 selfloop transitions, 3 changer transitions 0/198 dead transitions.
[2024-11-24 02:02:49,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 198 transitions, 1172 flow
[2024-11-24 02:02:49,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-24 02:02:49,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-24 02:02:49,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions.
[2024-11-24 02:02:49,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7151162790697675
[2024-11-24 02:02:49,677 INFO L175 Difference]: Start difference. First operand has 149 places, 160 transitions, 734 flow. Second operand 4 states and 492 transitions.
[2024-11-24 02:02:49,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 198 transitions, 1172 flow
[2024-11-24 02:02:49,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 198 transitions, 1168 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-24 02:02:49,748 INFO L231 Difference]: Finished difference. Result has 152 places, 161 transitions, 748 flow
[2024-11-24 02:02:49,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=748, PETRI_PLACES=152, PETRI_TRANSITIONS=161}
[2024-11-24 02:02:49,749 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -10 predicate places.
[2024-11-24 02:02:49,749 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 161 transitions, 748 flow
[2024-11-24 02:02:49,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 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-24 02:02:49,749 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:02:49,750 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 02:02:49,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-11-24 02:02:49,750 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:02:49,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:02:49,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1052934011, now seen corresponding path program 1 times
[2024-11-24 02:02:49,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:02:49,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191579446]
[2024-11-24 02:02:49,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:02:49,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:02:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:02:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2024-11-24 02:02:49,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:02:49,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191579446]
[2024-11-24 02:02:49,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191579446] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 02:02:49,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 02:02:49,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 02:02:49,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605633440]
[2024-11-24 02:02:49,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 02:02:49,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 02:02:49,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:02:49,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 02:02:49,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 02:02:49,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172
[2024-11-24 02:02:49,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 161 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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-24 02:02:49,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:02:49,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172
[2024-11-24 02:02:49,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:02:51,091 INFO L124 PetriNetUnfolderBase]: 3448/7669 cut-off events.
[2024-11-24 02:02:51,091 INFO L125 PetriNetUnfolderBase]: For 4569/4575 co-relation queries the response was YES.
[2024-11-24 02:02:51,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17266 conditions, 7669 events. 3448/7669 cut-off events. For 4569/4575 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 54563 event pairs, 1673 based on Foata normal form. 188/7129 useless extension candidates. Maximal degree in co-relation 17239. Up to 3127 conditions per place.
[2024-11-24 02:02:51,131 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 91 selfloop transitions, 3 changer transitions 0/142 dead transitions.
[2024-11-24 02:02:51,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 142 transitions, 757 flow
[2024-11-24 02:02:51,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 02:02:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 02:02:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions.
[2024-11-24 02:02:51,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7306201550387597
[2024-11-24 02:02:51,133 INFO L175 Difference]: Start difference. First operand has 152 places, 161 transitions, 748 flow. Second operand 3 states and 377 transitions.
[2024-11-24 02:02:51,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 142 transitions, 757 flow
[2024-11-24 02:02:51,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 142 transitions, 704 flow, removed 10 selfloop flow, removed 10 redundant places.
[2024-11-24 02:02:51,148 INFO L231 Difference]: Finished difference. Result has 141 places, 126 transitions, 487 flow
[2024-11-24 02:02:51,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=487, PETRI_PLACES=141, PETRI_TRANSITIONS=126}
[2024-11-24 02:02:51,149 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -21 predicate places.
[2024-11-24 02:02:51,149 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 126 transitions, 487 flow
[2024-11-24 02:02:51,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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-24 02:02:51,149 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:02:51,149 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 02:02:51,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-11-24 02:02:51,150 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:02:51,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:02:51,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2084985536, now seen corresponding path program 1 times
[2024-11-24 02:02:51,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:02:51,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053280377]
[2024-11-24 02:02:51,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:02:51,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:02:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:02:51,317 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2024-11-24 02:02:51,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:02:51,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053280377]
[2024-11-24 02:02:51,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053280377] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 02:02:51,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 02:02:51,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 02:02:51,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333613248]
[2024-11-24 02:02:51,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 02:02:51,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 02:02:51,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:02:51,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 02:02:51,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 02:02:51,320 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172
[2024-11-24 02:02:51,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 126 transitions, 487 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-24 02:02:51,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:02:51,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172
[2024-11-24 02:02:51,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:02:52,276 INFO L124 PetriNetUnfolderBase]: 2158/5370 cut-off events.
[2024-11-24 02:02:52,277 INFO L125 PetriNetUnfolderBase]: For 2280/2280 co-relation queries the response was YES.
[2024-11-24 02:02:52,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12105 conditions, 5370 events. 2158/5370 cut-off events. For 2280/2280 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 35658 event pairs, 547 based on Foata normal form. 312/5202 useless extension candidates. Maximal degree in co-relation 12083. Up to 2577 conditions per place.
[2024-11-24 02:02:52,312 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 83 selfloop transitions, 6 changer transitions 0/139 dead transitions.
[2024-11-24 02:02:52,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 139 transitions, 709 flow
[2024-11-24 02:02:52,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 02:02:52,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 02:02:52,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions.
[2024-11-24 02:02:52,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7306201550387597
[2024-11-24 02:02:52,314 INFO L175 Difference]: Start difference. First operand has 141 places, 126 transitions, 487 flow. Second operand 3 states and 377 transitions.
[2024-11-24 02:02:52,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 139 transitions, 709 flow
[2024-11-24 02:02:52,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 139 transitions, 699 flow, removed 1 selfloop flow, removed 3 redundant places.
[2024-11-24 02:02:52,326 INFO L231 Difference]: Finished difference. Result has 140 places, 126 transitions, 489 flow
[2024-11-24 02:02:52,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=489, PETRI_PLACES=140, PETRI_TRANSITIONS=126}
[2024-11-24 02:02:52,327 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -22 predicate places.
[2024-11-24 02:02:52,327 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 126 transitions, 489 flow
[2024-11-24 02:02:52,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-24 02:02:52,328 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:02:52,328 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 02:02:52,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-11-24 02:02:52,328 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:02:52,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:02:52,328 INFO L85 PathProgramCache]: Analyzing trace with hash 289840956, now seen corresponding path program 1 times
[2024-11-24 02:02:52,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:02:52,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464273369]
[2024-11-24 02:02:52,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:02:52,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:02:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:02:52,530 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2024-11-24 02:02:52,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:02:52,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464273369]
[2024-11-24 02:02:52,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464273369] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 02:02:52,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 02:02:52,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 02:02:52,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655849204]
[2024-11-24 02:02:52,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 02:02:52,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 02:02:52,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:02:52,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 02:02:52,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-24 02:02:53,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 172
[2024-11-24 02:02:53,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 126 transitions, 489 flow. Second operand has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 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-24 02:02:53,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:02:53,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 172
[2024-11-24 02:02:53,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:02:54,125 INFO L124 PetriNetUnfolderBase]: 2158/4999 cut-off events.
[2024-11-24 02:02:54,125 INFO L125 PetriNetUnfolderBase]: For 2526/2528 co-relation queries the response was YES.
[2024-11-24 02:02:54,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12152 conditions, 4999 events. 2158/4999 cut-off events. For 2526/2528 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 31450 event pairs, 1492 based on Foata normal form. 156/4921 useless extension candidates. Maximal degree in co-relation 12131. Up to 3199 conditions per place.
[2024-11-24 02:02:54,166 INFO L140 encePairwiseOnDemand]: 161/172 looper letters, 78 selfloop transitions, 3 changer transitions 0/123 dead transitions.
[2024-11-24 02:02:54,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 123 transitions, 652 flow
[2024-11-24 02:02:54,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-24 02:02:54,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-24 02:02:54,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 445 transitions.
[2024-11-24 02:02:54,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6468023255813954
[2024-11-24 02:02:54,169 INFO L175 Difference]: Start difference. First operand has 140 places, 126 transitions, 489 flow. Second operand 4 states and 445 transitions.
[2024-11-24 02:02:54,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 123 transitions, 652 flow
[2024-11-24 02:02:54,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 123 transitions, 646 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-24 02:02:54,180 INFO L231 Difference]: Finished difference. Result has 134 places, 118 transitions, 473 flow
[2024-11-24 02:02:54,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=473, PETRI_PLACES=134, PETRI_TRANSITIONS=118}
[2024-11-24 02:02:54,182 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -28 predicate places.
[2024-11-24 02:02:54,183 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 118 transitions, 473 flow
[2024-11-24 02:02:54,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 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-24 02:02:54,183 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:02:54,184 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 02:02:54,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-11-24 02:02:54,184 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:02:54,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:02:54,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1734905059, now seen corresponding path program 1 times
[2024-11-24 02:02:54,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:02:54,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047764290]
[2024-11-24 02:02:54,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:02:54,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:02:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:02:54,446 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2024-11-24 02:02:54,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:02:54,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047764290]
[2024-11-24 02:02:54,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047764290] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 02:02:54,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 02:02:54,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 02:02:54,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124937828]
[2024-11-24 02:02:54,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 02:02:54,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 02:02:54,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:02:54,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 02:02:54,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-24 02:02:54,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 172
[2024-11-24 02:02:54,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 118 transitions, 473 flow. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 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-24 02:02:54,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:02:54,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 172
[2024-11-24 02:02:54,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:02:55,739 INFO L124 PetriNetUnfolderBase]: 2158/4777 cut-off events.
[2024-11-24 02:02:55,739 INFO L125 PetriNetUnfolderBase]: For 2435/2437 co-relation queries the response was YES.
[2024-11-24 02:02:55,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11744 conditions, 4777 events. 2158/4777 cut-off events. For 2435/2437 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 28631 event pairs, 1492 based on Foata normal form. 156/4803 useless extension candidates. Maximal degree in co-relation 11722. Up to 3199 conditions per place.
[2024-11-24 02:02:55,761 INFO L140 encePairwiseOnDemand]: 162/172 looper letters, 78 selfloop transitions, 3 changer transitions 0/116 dead transitions.
[2024-11-24 02:02:55,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 116 transitions, 638 flow
[2024-11-24 02:02:55,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-24 02:02:55,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-24 02:02:55,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions.
[2024-11-24 02:02:55,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6511627906976745
[2024-11-24 02:02:55,763 INFO L175 Difference]: Start difference. First operand has 134 places, 118 transitions, 473 flow. Second operand 4 states and 448 transitions.
[2024-11-24 02:02:55,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 116 transitions, 638 flow
[2024-11-24 02:02:55,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 116 transitions, 632 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-24 02:02:55,775 INFO L231 Difference]: Finished difference. Result has 127 places, 111 transitions, 459 flow
[2024-11-24 02:02:55,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=459, PETRI_PLACES=127, PETRI_TRANSITIONS=111}
[2024-11-24 02:02:55,776 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -35 predicate places.
[2024-11-24 02:02:55,776 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 111 transitions, 459 flow
[2024-11-24 02:02:55,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 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-24 02:02:55,776 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:02:55,776 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 02:02:55,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-11-24 02:02:55,777 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:02:55,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:02:55,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1259546049, now seen corresponding path program 1 times
[2024-11-24 02:02:55,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:02:55,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425835571]
[2024-11-24 02:02:55,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:02:55,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:02:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:02:55,902 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2024-11-24 02:02:55,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:02:55,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425835571]
[2024-11-24 02:02:55,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425835571] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 02:02:55,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 02:02:55,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-24 02:02:55,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161766355]
[2024-11-24 02:02:55,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 02:02:55,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 02:02:55,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:02:55,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 02:02:55,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-24 02:02:55,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172
[2024-11-24 02:02:55,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 111 transitions, 459 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 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-24 02:02:55,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:02:55,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172
[2024-11-24 02:02:55,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:02:57,138 INFO L124 PetriNetUnfolderBase]: 2959/6823 cut-off events.
[2024-11-24 02:02:57,138 INFO L125 PetriNetUnfolderBase]: For 3573/3579 co-relation queries the response was YES.
[2024-11-24 02:02:57,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16270 conditions, 6823 events. 2959/6823 cut-off events. For 3573/3579 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 46493 event pairs, 1046 based on Foata normal form. 202/6850 useless extension candidates. Maximal degree in co-relation 16248. Up to 2626 conditions per place.
[2024-11-24 02:02:57,180 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 200 selfloop transitions, 3 changer transitions 0/238 dead transitions.
[2024-11-24 02:02:57,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 238 transitions, 1461 flow
[2024-11-24 02:02:57,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-24 02:02:57,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-24 02:02:57,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 560 transitions.
[2024-11-24 02:02:57,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.813953488372093
[2024-11-24 02:02:57,182 INFO L175 Difference]: Start difference. First operand has 127 places, 111 transitions, 459 flow. Second operand 4 states and 560 transitions.
[2024-11-24 02:02:57,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 238 transitions, 1461 flow
[2024-11-24 02:02:57,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 238 transitions, 1447 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-24 02:02:57,197 INFO L231 Difference]: Finished difference. Result has 128 places, 112 transitions, 469 flow
[2024-11-24 02:02:57,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=469, PETRI_PLACES=128, PETRI_TRANSITIONS=112}
[2024-11-24 02:02:57,198 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -34 predicate places.
[2024-11-24 02:02:57,198 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 112 transitions, 469 flow
[2024-11-24 02:02:57,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 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-24 02:02:57,199 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:02:57,199 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 02:02:57,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-11-24 02:02:57,199 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:02:57,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:02:57,200 INFO L85 PathProgramCache]: Analyzing trace with hash -721762581, now seen corresponding path program 1 times
[2024-11-24 02:02:57,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:02:57,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429964774]
[2024-11-24 02:02:57,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:02:57,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:02:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:02:57,977 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2024-11-24 02:02:57,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:02:57,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429964774]
[2024-11-24 02:02:57,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429964774] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-24 02:02:57,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642365498]
[2024-11-24 02:02:57,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:02:57,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 02:02:57,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 02:02:57,980 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 02:02:57,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-24 02:02:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:02:58,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 35 conjuncts are in the unsatisfiable core
[2024-11-24 02:02:58,212 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 02:02:58,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2024-11-24 02:02:58,380 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 29 treesize of output 13
[2024-11-24 02:02:58,673 INFO L173 IndexEqualityManager]: detected equality via solver
[2024-11-24 02:02:58,706 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size
[2024-11-24 02:02:58,706 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16
[2024-11-24 02:02:58,756 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-24 02:02:58,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13
[2024-11-24 02:02:58,784 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 9 treesize of output 3
[2024-11-24 02:02:58,823 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-24 02:02:58,823 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 02:02:58,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642365498] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 02:02:58,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-24 02:02:58,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13
[2024-11-24 02:02:58,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697425538]
[2024-11-24 02:02:58,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 02:02:58,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-24 02:02:58,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:02:58,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-24 02:02:58,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156
[2024-11-24 02:03:00,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 172
[2024-11-24 02:03:00,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 112 transitions, 469 flow. Second operand has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 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-24 02:03:00,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:03:00,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 172
[2024-11-24 02:03:00,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:03:01,420 INFO L124 PetriNetUnfolderBase]: 2598/5600 cut-off events.
[2024-11-24 02:03:01,420 INFO L125 PetriNetUnfolderBase]: For 4268/4268 co-relation queries the response was YES.
[2024-11-24 02:03:01,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14428 conditions, 5600 events. 2598/5600 cut-off events. For 4268/4268 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 34029 event pairs, 644 based on Foata normal form. 0/5433 useless extension candidates. Maximal degree in co-relation 14405. Up to 4105 conditions per place.
[2024-11-24 02:03:01,475 INFO L140 encePairwiseOnDemand]: 163/172 looper letters, 104 selfloop transitions, 8 changer transitions 0/134 dead transitions.
[2024-11-24 02:03:01,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 134 transitions, 763 flow
[2024-11-24 02:03:01,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-24 02:03:01,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-24 02:03:01,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 742 transitions.
[2024-11-24 02:03:01,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6162790697674418
[2024-11-24 02:03:01,478 INFO L175 Difference]: Start difference. First operand has 128 places, 112 transitions, 469 flow. Second operand 7 states and 742 transitions.
[2024-11-24 02:03:01,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 134 transitions, 763 flow
[2024-11-24 02:03:01,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 134 transitions, 701 flow, removed 15 selfloop flow, removed 9 redundant places.
[2024-11-24 02:03:01,491 INFO L231 Difference]: Finished difference. Result has 118 places, 100 transitions, 355 flow
[2024-11-24 02:03:01,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=355, PETRI_PLACES=118, PETRI_TRANSITIONS=100}
[2024-11-24 02:03:01,492 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -44 predicate places.
[2024-11-24 02:03:01,492 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 100 transitions, 355 flow
[2024-11-24 02:03:01,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 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-24 02:03:01,493 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:03:01,493 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 02:03:01,505 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-24 02:03:01,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 02:03:01,694 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:03:01,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:03:01,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1932485421, now seen corresponding path program 1 times
[2024-11-24 02:03:01,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:03:01,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209379711]
[2024-11-24 02:03:01,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:03:01,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:03:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:03:03,488 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-24 02:03:03,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:03:03,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209379711]
[2024-11-24 02:03:03,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209379711] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-24 02:03:03,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987188573]
[2024-11-24 02:03:03,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:03:03,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 02:03:03,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 02:03:03,491 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 02:03:03,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-24 02:03:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:03:03,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 58 conjuncts are in the unsatisfiable core
[2024-11-24 02:03:03,705 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 02:03:03,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2024-11-24 02:03:03,862 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 29 treesize of output 13
[2024-11-24 02:03:04,190 INFO L173 IndexEqualityManager]: detected equality via solver
[2024-11-24 02:03:04,226 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size
[2024-11-24 02:03:04,226 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16
[2024-11-24 02:03:04,374 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-24 02:03:04,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13
[2024-11-24 02:03:04,684 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 29 treesize of output 3
[2024-11-24 02:03:05,069 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size
[2024-11-24 02:03:05,069 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 42 treesize of output 16
[2024-11-24 02:03:05,102 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 29 treesize of output 13
[2024-11-24 02:03:05,120 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 19 treesize of output 7
[2024-11-24 02:03:05,198 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-24 02:03:05,198 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-24 02:03:23,424 INFO L349 Elim1Store]: treesize reduction 56, result has 43.4 percent of original size
[2024-11-24 02:03:23,424 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 142 treesize of output 148
[2024-11-24 02:03:23,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-24 02:03:23,451 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 113 treesize of output 111
[2024-11-24 02:03:23,528 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-24 02:03:23,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-24 02:03:23,605 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 84 treesize of output 78
[2024-11-24 02:03:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-24 02:03:23,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987188573] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-24 02:03:23,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-24 02:03:23,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 15] total 36
[2024-11-24 02:03:23,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482407326]
[2024-11-24 02:03:23,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-24 02:03:23,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2024-11-24 02:03:23,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:03:23,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2024-11-24 02:03:23,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1106, Unknown=4, NotChecked=0, Total=1332
[2024-11-24 02:03:27,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-24 02:03:31,997 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-24 02:03:36,071 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-24 02:03:40,140 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-24 02:03:44,343 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-24 02:03:48,426 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-24 02:03:52,713 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-24 02:03:56,860 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-24 02:04:01,012 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-24 02:04:05,185 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-24 02:04:09,333 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-24 02:04:13,486 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-24 02:04:17,642 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-24 02:04:21,794 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-24 02:04:25,964 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-24 02:04:30,113 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-24 02:04:34,286 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-24 02:04:38,465 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-24 02:04:42,615 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-24 02:04:46,761 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-24 02:04:50,915 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-24 02:04:55,070 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-24 02:04:59,253 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-24 02:05:03,555 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-24 02:05:07,701 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-24 02:05:11,848 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-24 02:05:15,992 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-24 02:05:20,136 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-24 02:05:24,287 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-24 02:05:28,523 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-24 02:05:32,668 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-24 02:05:36,816 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-24 02:05:40,962 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-24 02:05:45,135 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-24 02:05:49,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-24 02:05:53,480 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-24 02:05:57,690 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-24 02:06:01,832 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-24 02:06:06,013 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-24 02:06:10,177 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-24 02:06:14,376 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-24 02:06:18,545 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-24 02:06:18,601 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 172
[2024-11-24 02:06:18,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 100 transitions, 355 flow. Second operand has 37 states, 37 states have (on average 53.21621621621622) internal successors, (1969), 37 states have internal predecessors, (1969), 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-24 02:06:18,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:06:18,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 172
[2024-11-24 02:06:18,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:06:23,348 INFO L124 PetriNetUnfolderBase]: 2337/4970 cut-off events.
[2024-11-24 02:06:23,349 INFO L125 PetriNetUnfolderBase]: For 2713/2713 co-relation queries the response was YES.
[2024-11-24 02:06:23,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12234 conditions, 4970 events. 2337/4970 cut-off events. For 2713/2713 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 27866 event pairs, 444 based on Foata normal form. 0/4869 useless extension candidates. Maximal degree in co-relation 12217. Up to 1959 conditions per place.
[2024-11-24 02:06:23,372 INFO L140 encePairwiseOnDemand]: 151/172 looper letters, 188 selfloop transitions, 21 changer transitions 0/225 dead transitions.
[2024-11-24 02:06:23,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 225 transitions, 1258 flow
[2024-11-24 02:06:23,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2024-11-24 02:06:23,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2024-11-24 02:06:23,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 978 transitions.
[2024-11-24 02:06:23,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3553779069767442
[2024-11-24 02:06:23,375 INFO L175 Difference]: Start difference. First operand has 118 places, 100 transitions, 355 flow. Second operand 16 states and 978 transitions.
[2024-11-24 02:06:23,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 225 transitions, 1258 flow
[2024-11-24 02:06:23,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 225 transitions, 1236 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-11-24 02:06:23,383 INFO L231 Difference]: Finished difference. Result has 128 places, 100 transitions, 380 flow
[2024-11-24 02:06:23,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=380, PETRI_PLACES=128, PETRI_TRANSITIONS=100}
[2024-11-24 02:06:23,384 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -34 predicate places.
[2024-11-24 02:06:23,385 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 100 transitions, 380 flow
[2024-11-24 02:06:23,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 53.21621621621622) internal successors, (1969), 37 states have internal predecessors, (1969), 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-24 02:06:23,386 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:06:23,386 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 02:06:23,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-11-24 02:06:23,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25
[2024-11-24 02:06:23,591 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:06:23,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:06:23,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1193290036, now seen corresponding path program 1 times
[2024-11-24 02:06:23,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:06:23,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138156140]
[2024-11-24 02:06:23,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:06:23,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:06:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:06:26,453 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-24 02:06:26,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:06:26,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138156140]
[2024-11-24 02:06:26,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138156140] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-24 02:06:26,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956252954]
[2024-11-24 02:06:26,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:06:26,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 02:06:26,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 02:06:26,456 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 02:06:26,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-24 02:06:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:06:26,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 86 conjuncts are in the unsatisfiable core
[2024-11-24 02:06:26,662 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 02:06:26,817 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-24 02:06:26,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-11-24 02:06:27,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21
[2024-11-24 02:06:27,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21
[2024-11-24 02:06:27,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21
[2024-11-24 02:06:28,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14
[2024-11-24 02:06:28,575 INFO L349 Elim1Store]: treesize reduction 36, result has 39.0 percent of original size
[2024-11-24 02:06:28,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 44
[2024-11-24 02:06:28,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22
[2024-11-24 02:06:29,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24
[2024-11-24 02:06:29,653 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-24 02:06:29,653 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-24 02:08:19,432 INFO L349 Elim1Store]: treesize reduction 174, result has 39.8 percent of original size
[2024-11-24 02:08:19,433 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 1184 treesize of output 1162
[2024-11-24 02:08:19,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-24 02:08:19,504 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 298 treesize of output 288
[2024-11-24 02:08:19,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 53
[2024-11-24 02:08:20,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-24 02:08:20,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 560 treesize of output 468
[2024-11-24 02:08:21,436 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-24 02:08:21,438 INFO L173 IndexEqualityManager]: detected equality via solver
[2024-11-24 02:08:21,452 INFO L173 IndexEqualityManager]: detected equality via solver
[2024-11-24 02:08:21,461 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-24 02:08:21,463 INFO L173 IndexEqualityManager]: detected equality via solver
[2024-11-24 02:08:21,478 INFO L173 IndexEqualityManager]: detected equality via solver
[2024-11-24 02:08:21,566 INFO L349 Elim1Store]: treesize reduction 114, result has 21.4 percent of original size
[2024-11-24 02:08:21,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 258 treesize of output 210
[2024-11-24 02:08:21,581 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-24 02:08:21,582 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 78 treesize of output 68
[2024-11-24 02:08:21,591 INFO L173 IndexEqualityManager]: detected equality via solver
[2024-11-24 02:08:21,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-24 02:08:21,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 78
[2024-11-24 02:08:21,934 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-24 02:08:21,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956252954] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-24 02:08:21,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-24 02:08:21,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 20] total 54
[2024-11-24 02:08:21,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334546901]
[2024-11-24 02:08:21,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-24 02:08:21,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states
[2024-11-24 02:08:21,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:08:21,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants.
[2024-11-24 02:08:21,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=2545, Unknown=16, NotChecked=0, Total=3080
[2024-11-24 02:08:23,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-11-24 02:08:27,256 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-24 02:08:28,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-11-24 02:08:32,801 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-24 02:08:36,842 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-24 02:08:41,059 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-24 02:08:45,094 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-24 02:08:49,313 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-24 02:08:54,408 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-24 02:08:55,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-11-24 02:08:59,566 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-24 02:09:01,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-11-24 02:09:05,084 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-24 02:09:09,277 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-24 02:09:10,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-11-24 02:09:14,587 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-24 02:09:19,485 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-24 02:09:20,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-11-24 02:09:22,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-11-24 02:09:26,117 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-24 02:09:30,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-11-24 02:09:34,283 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-24 02:09:39,668 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-24 02:09:44,015 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-24 02:09:48,069 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-24 02:09:52,081 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-24 02:09:57,006 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-24 02:10:01,018 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-24 02:10:05,154 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-24 02:10:06,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-11-24 02:10:10,727 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-24 02:10:15,668 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-24 02:10:19,809 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-24 02:10:23,855 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-24 02:10:25,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-11-24 02:10:30,008 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-24 02:10:32,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-11-24 02:10:36,707 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-24 02:10:40,950 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-24 02:10:45,379 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-24 02:10:49,559 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-24 02:10:55,353 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-24 02:10:57,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-11-24 02:11:01,149 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-24 02:11:05,168 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-24 02:11:09,407 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-24 02:11:13,635 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-24 02:11:17,653 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-24 02:11:20,511 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-24 02:11:24,536 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-24 02:11:27,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-11-24 02:11:31,468 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-24 02:11:35,496 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-24 02:11:39,548 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-24 02:11:42,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-11-24 02:11:46,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-24 02:11:50,688 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-24 02:11:54,728 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-24 02:11:58,834 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-24 02:12:02,860 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-24 02:12:07,069 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-24 02:12:11,093 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-24 02:12:16,155 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-24 02:12:20,179 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-24 02:12:24,279 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-24 02:12:28,294 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-24 02:12:32,430 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-24 02:12:36,450 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-24 02:12:40,535 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-24 02:12:44,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-11-24 02:12:48,488 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-24 02:12:49,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-11-24 02:12:53,854 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-24 02:12:53,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 172
[2024-11-24 02:12:53,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 100 transitions, 380 flow. Second operand has 56 states, 56 states have (on average 24.517857142857142) internal successors, (1373), 56 states have internal predecessors, (1373), 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-24 02:12:53,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:12:53,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 172
[2024-11-24 02:12:53,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:13:11,756 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-24 02:13:15,818 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-24 02:13:19,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-11-24 02:13:23,997 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-24 02:13:28,004 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-24 02:13:29,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-11-24 02:13:33,426 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-24 02:13:37,436 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-24 02:13:41,936 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-24 02:13:46,117 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-24 02:13:48,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-11-24 02:13:53,055 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-24 02:13:58,154 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-24 02:14:02,479 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-24 02:14:48,687 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-24 02:14:52,724 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-24 02:14:54,565 INFO L124 PetriNetUnfolderBase]: 3470/7077 cut-off events.
[2024-11-24 02:14:54,565 INFO L125 PetriNetUnfolderBase]: For 4105/4105 co-relation queries the response was YES.
[2024-11-24 02:14:54,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17853 conditions, 7077 events. 3470/7077 cut-off events. For 4105/4105 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 42200 event pairs, 474 based on Foata normal form. 0/6846 useless extension candidates. Maximal degree in co-relation 17835. Up to 2094 conditions per place.
[2024-11-24 02:14:54,638 INFO L140 encePairwiseOnDemand]: 140/172 looper letters, 300 selfloop transitions, 43 changer transitions 0/355 dead transitions.
[2024-11-24 02:14:54,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 355 transitions, 2053 flow
[2024-11-24 02:14:54,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states.
[2024-11-24 02:14:54,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states.
[2024-11-24 02:14:54,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 994 transitions.
[2024-11-24 02:14:54,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.18059593023255813
[2024-11-24 02:14:54,651 INFO L175 Difference]: Start difference. First operand has 128 places, 100 transitions, 380 flow. Second operand 32 states and 994 transitions.
[2024-11-24 02:14:54,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 355 transitions, 2053 flow
[2024-11-24 02:14:54,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 355 transitions, 2013 flow, removed 0 selfloop flow, removed 14 redundant places.
[2024-11-24 02:14:54,680 INFO L231 Difference]: Finished difference. Result has 157 places, 122 transitions, 569 flow
[2024-11-24 02:14:54,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=569, PETRI_PLACES=157, PETRI_TRANSITIONS=122}
[2024-11-24 02:14:54,681 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -5 predicate places.
[2024-11-24 02:14:54,681 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 122 transitions, 569 flow
[2024-11-24 02:14:54,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 24.517857142857142) internal successors, (1373), 56 states have internal predecessors, (1373), 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-24 02:14:54,686 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:14:54,686 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 02:14:54,701 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-11-24 02:14:54,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26
[2024-11-24 02:14:54,887 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:14:54,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:14:54,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1229368804, now seen corresponding path program 1 times
[2024-11-24 02:14:54,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:14:54,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302736925]
[2024-11-24 02:14:54,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:14:54,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:14:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:14:55,411 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2024-11-24 02:14:55,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:14:55,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302736925]
[2024-11-24 02:14:55,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302736925] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-24 02:14:55,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794648006]
[2024-11-24 02:14:55,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:14:55,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 02:14:55,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 02:14:55,415 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 02:14:55,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-11-24 02:14:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:14:55,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-24 02:14:55,655 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 02:14:55,967 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2024-11-24 02:14:55,967 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 02:14:55,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794648006] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 02:14:55,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-24 02:14:55,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5
[2024-11-24 02:14:55,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561984265]
[2024-11-24 02:14:55,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 02:14:55,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 02:14:55,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:14:55,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 02:14:55,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-24 02:14:56,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172
[2024-11-24 02:14:56,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 122 transitions, 569 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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-24 02:14:56,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:14:56,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172
[2024-11-24 02:14:56,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:14:57,677 INFO L124 PetriNetUnfolderBase]: 2862/6431 cut-off events.
[2024-11-24 02:14:57,677 INFO L125 PetriNetUnfolderBase]: For 4260/4272 co-relation queries the response was YES.
[2024-11-24 02:14:57,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16431 conditions, 6431 events. 2862/6431 cut-off events. For 4260/4272 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 41687 event pairs, 2363 based on Foata normal form. 9/6207 useless extension candidates. Maximal degree in co-relation 16401. Up to 4886 conditions per place.
[2024-11-24 02:14:57,739 INFO L140 encePairwiseOnDemand]: 170/172 looper letters, 79 selfloop transitions, 1 changer transitions 2/121 dead transitions.
[2024-11-24 02:14:57,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 121 transitions, 729 flow
[2024-11-24 02:14:57,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 02:14:57,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 02:14:57,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions.
[2024-11-24 02:14:57,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512
[2024-11-24 02:14:57,742 INFO L175 Difference]: Start difference. First operand has 157 places, 122 transitions, 569 flow. Second operand 3 states and 360 transitions.
[2024-11-24 02:14:57,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 121 transitions, 729 flow
[2024-11-24 02:14:57,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 121 transitions, 671 flow, removed 10 selfloop flow, removed 14 redundant places.
[2024-11-24 02:14:57,759 INFO L231 Difference]: Finished difference. Result has 144 places, 119 transitions, 506 flow
[2024-11-24 02:14:57,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=144, PETRI_TRANSITIONS=119}
[2024-11-24 02:14:57,762 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -18 predicate places.
[2024-11-24 02:14:57,762 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 119 transitions, 506 flow
[2024-11-24 02:14:57,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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-24 02:14:57,762 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:14:57,762 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, 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-24 02:14:57,773 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-11-24 02:14:57,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27
[2024-11-24 02:14:57,963 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:14:57,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:14:57,966 INFO L85 PathProgramCache]: Analyzing trace with hash 428819130, now seen corresponding path program 1 times
[2024-11-24 02:14:57,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:14:57,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490937514]
[2024-11-24 02:14:57,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:14:57,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:14:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:14:58,603 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2024-11-24 02:14:58,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:14:58,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490937514]
[2024-11-24 02:14:58,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490937514] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 02:14:58,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 02:14:58,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 02:14:58,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273180335]
[2024-11-24 02:14:58,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 02:14:58,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 02:14:58,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:14:58,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 02:14:58,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-24 02:14:59,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172
[2024-11-24 02:14:59,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 119 transitions, 506 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 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-24 02:14:59,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 02:14:59,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172
[2024-11-24 02:14:59,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 02:15:00,870 INFO L124 PetriNetUnfolderBase]: 2882/6462 cut-off events.
[2024-11-24 02:15:00,870 INFO L125 PetriNetUnfolderBase]: For 3942/3956 co-relation queries the response was YES.
[2024-11-24 02:15:00,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16145 conditions, 6462 events. 2882/6462 cut-off events. For 3942/3956 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 41935 event pairs, 1809 based on Foata normal form. 18/6301 useless extension candidates. Maximal degree in co-relation 16114. Up to 4088 conditions per place.
[2024-11-24 02:15:00,926 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 139 selfloop transitions, 3 changer transitions 0/180 dead transitions.
[2024-11-24 02:15:00,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 180 transitions, 1060 flow
[2024-11-24 02:15:00,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-24 02:15:00,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-24 02:15:00,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 503 transitions.
[2024-11-24 02:15:00,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7311046511627907
[2024-11-24 02:15:00,928 INFO L175 Difference]: Start difference. First operand has 144 places, 119 transitions, 506 flow. Second operand 4 states and 503 transitions.
[2024-11-24 02:15:00,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 180 transitions, 1060 flow
[2024-11-24 02:15:00,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 180 transitions, 1059 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-24 02:15:00,971 INFO L231 Difference]: Finished difference. Result has 145 places, 119 transitions, 515 flow
[2024-11-24 02:15:00,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=515, PETRI_PLACES=145, PETRI_TRANSITIONS=119}
[2024-11-24 02:15:00,972 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -17 predicate places.
[2024-11-24 02:15:00,976 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 119 transitions, 515 flow
[2024-11-24 02:15:00,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 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-24 02:15:00,976 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 02:15:00,976 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, 1, 1, 1, 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-24 02:15:00,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-11-24 02:15:00,977 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] ===
[2024-11-24 02:15:00,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 02:15:00,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1621912487, now seen corresponding path program 1 times
[2024-11-24 02:15:00,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 02:15:00,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213031490]
[2024-11-24 02:15:00,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:15:00,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 02:15:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:15:06,729 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-24 02:15:06,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 02:15:06,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213031490]
[2024-11-24 02:15:06,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213031490] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-24 02:15:06,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200665463]
[2024-11-24 02:15:06,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 02:15:06,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 02:15:06,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 02:15:06,733 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 02:15:06,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98a47ca8-76e5-4602-a3b5-d046eb68bf8c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-11-24 02:15:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 02:15:06,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 76 conjuncts are in the unsatisfiable core
[2024-11-24 02:15:06,979 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 02:15:07,121 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-24 02:15:07,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-11-24 02:15:07,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21
[2024-11-24 02:15:07,970 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-24 02:15:07,974 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-24 02:15:07,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21
[2024-11-24 02:15:08,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21
[2024-11-24 02:15:08,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14
[2024-11-24 02:15:08,901 INFO L349 Elim1Store]: treesize reduction 36, result has 39.0 percent of original size
[2024-11-24 02:15:08,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 44
[2024-11-24 02:15:09,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22
[2024-11-24 02:15:09,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15
[2024-11-24 02:15:10,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21
[2024-11-24 02:15:10,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2024-11-24 02:15:10,264 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-24 02:15:10,264 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-24 02:15:24,547 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-24 02:15:24,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200665463] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-24 02:15:24,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-24 02:15:24,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 19] total 53
[2024-11-24 02:15:24,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398776468]
[2024-11-24 02:15:24,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-24 02:15:24,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states
[2024-11-24 02:15:24,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 02:15:24,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants.
[2024-11-24 02:15:24,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=2439, Unknown=0, NotChecked=0, Total=2862
[2024-11-24 02:15:31,677 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-24 02:15:36,753 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-24 02:15:39,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]