./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/queue_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread/queue_longer.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 16:06:12,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:06:12,661 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 16:06:12,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:06:12,664 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:06:12,687 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:06:12,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:06:12,688 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:06:12,688 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:06:12,691 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:06:12,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:06:12,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:06:12,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:06:12,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:06:12,693 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:06:12,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:06:12,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:06:12,694 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:06:12,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:06:12,694 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:06:12,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:06:12,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:06:12,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:06:12,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:06:12,695 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:06:12,695 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:06:12,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:06:12,695 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:06:12,696 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:06:12,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:06:12,697 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:06:12,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:06:12,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:06:12,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:06:12,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:06:12,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:06:12,697 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:06:12,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:06:12,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:06:12,698 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:06:12,698 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:06:12,698 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:06:12,698 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:06:12,698 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 ! call(reach_error())) ) 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 -> 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 [2024-01-27 16:06:12,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:06:12,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:06:12,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:06:12,914 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:06:12,915 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:06:12,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longer.i [2024-01-27 16:06:13,888 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:06:14,081 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:06:14,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i [2024-01-27 16:06:14,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55f9cf7b6/531ac82a2fa14f6b9f367f3c1a11d480/FLAG4a4ddfc99 [2024-01-27 16:06:14,113 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55f9cf7b6/531ac82a2fa14f6b9f367f3c1a11d480 [2024-01-27 16:06:14,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:06:14,116 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:06:14,117 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:06:14,118 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:06:14,122 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:06:14,122 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:14,123 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c00169f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14, skipping insertion in model container [2024-01-27 16:06:14,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:14,159 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:06:14,552 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2024-01-27 16:06:14,560 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2024-01-27 16:06:14,565 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2024-01-27 16:06:14,572 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:06:14,585 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:06:14,629 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2024-01-27 16:06:14,630 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2024-01-27 16:06:14,632 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2024-01-27 16:06:14,633 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:06:14,685 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:06:14,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14 WrapperNode [2024-01-27 16:06:14,685 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:06:14,686 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:06:14,686 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:06:14,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:06:14,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:14,708 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:14,746 INFO L138 Inliner]: procedures = 275, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 249 [2024-01-27 16:06:14,747 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:06:14,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:06:14,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:06:14,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:06:14,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:14,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:14,767 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:14,779 INFO L175 MemorySlicer]: Split 47 memory accesses to 6 slices as follows [32, 2, 5, 4, 2, 2]. 68 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [0, 2, 5, 0, 0, 0]. The 20 writes are split as follows [15, 0, 0, 3, 1, 1]. [2024-01-27 16:06:14,779 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:14,779 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:14,787 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:14,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:14,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:14,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:14,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:06:14,796 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:06:14,796 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:06:14,796 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:06:14,797 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:14,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:06:14,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:06:14,821 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 16:06:14,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 16:06:14,862 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-01-27 16:06:14,863 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-01-27 16:06:14,863 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-01-27 16:06:14,863 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-01-27 16:06:14,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:06:14,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:06:14,863 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-27 16:06:14,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 16:06:14,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 16:06:14,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 16:06:14,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 16:06:14,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 16:06:14,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-01-27 16:06:14,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:06:14,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:06:14,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 16:06:14,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 16:06:14,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 16:06:14,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-01-27 16:06:14,865 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-27 16:06:14,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:06:14,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:06:14,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:06:14,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 16:06:14,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 16:06:14,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 16:06:14,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-01-27 16:06:14,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:06:14,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:06:14,867 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 16:06:14,987 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:06:14,989 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:06:15,258 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:06:15,258 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:06:15,481 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:06:15,481 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-01-27 16:06:15,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:06:15 BoogieIcfgContainer [2024-01-27 16:06:15,482 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:06:15,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:06:15,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:06:15,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:06:15,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:06:14" (1/3) ... [2024-01-27 16:06:15,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f05c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:06:15, skipping insertion in model container [2024-01-27 16:06:15,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14" (2/3) ... [2024-01-27 16:06:15,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f05c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:06:15, skipping insertion in model container [2024-01-27 16:06:15,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:06:15" (3/3) ... [2024-01-27 16:06:15,493 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2024-01-27 16:06:15,499 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:06:15,505 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:06:15,506 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-01-27 16:06:15,506 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:06:15,553 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 16:06:15,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 48 transitions, 110 flow [2024-01-27 16:06:15,604 INFO L124 PetriNetUnfolderBase]: 7/46 cut-off events. [2024-01-27 16:06:15,605 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 16:06:15,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 46 events. 7/46 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-01-27 16:06:15,607 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 48 transitions, 110 flow [2024-01-27 16:06:15,611 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 44 transitions, 97 flow [2024-01-27 16:06:15,625 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:06:15,631 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@30cab37a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:06:15,631 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-01-27 16:06:15,636 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:06:15,636 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-01-27 16:06:15,636 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:06:15,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:15,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-27 16:06:15,638 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:15,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:15,642 INFO L85 PathProgramCache]: Analyzing trace with hash 644995, now seen corresponding path program 1 times [2024-01-27 16:06:15,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:15,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523158535] [2024-01-27 16:06:15,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:15,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:15,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:15,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523158535] [2024-01-27 16:06:15,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523158535] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:15,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:15,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 16:06:15,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023445138] [2024-01-27 16:06:15,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:15,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-27 16:06:15,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:15,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-27 16:06:15,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-27 16:06:15,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-01-27 16:06:15,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 44 transitions, 97 flow. Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-01-27 16:06:15,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:15,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-01-27 16:06:15,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:16,052 INFO L124 PetriNetUnfolderBase]: 435/787 cut-off events. [2024-01-27 16:06:16,053 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-01-27 16:06:16,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1540 conditions, 787 events. 435/787 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3602 event pairs, 339 based on Foata normal form. 48/745 useless extension candidates. Maximal degree in co-relation 1440. Up to 713 conditions per place. [2024-01-27 16:06:16,062 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 32 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2024-01-27 16:06:16,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 39 transitions, 151 flow [2024-01-27 16:06:16,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-27 16:06:16,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-01-27 16:06:16,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 55 transitions. [2024-01-27 16:06:16,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5729166666666666 [2024-01-27 16:06:16,072 INFO L175 Difference]: Start difference. First operand has 44 places, 44 transitions, 97 flow. Second operand 2 states and 55 transitions. [2024-01-27 16:06:16,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 39 transitions, 151 flow [2024-01-27 16:06:16,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 39 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 16:06:16,077 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 82 flow [2024-01-27 16:06:16,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=82, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2024-01-27 16:06:16,081 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2024-01-27 16:06:16,081 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 82 flow [2024-01-27 16:06:16,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-01-27 16:06:16,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:16,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:16,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:06:16,083 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:16,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:16,083 INFO L85 PathProgramCache]: Analyzing trace with hash 930513047, now seen corresponding path program 1 times [2024-01-27 16:06:16,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:16,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703286263] [2024-01-27 16:06:16,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:16,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:16,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:16,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:16,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703286263] [2024-01-27 16:06:16,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703286263] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:16,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:16,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:06:16,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891330117] [2024-01-27 16:06:16,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:16,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:06:16,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:16,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:06:16,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:06:16,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-01-27 16:06:16,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-01-27 16:06:16,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:16,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-01-27 16:06:16,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:16,396 INFO L124 PetriNetUnfolderBase]: 415/767 cut-off events. [2024-01-27 16:06:16,396 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-01-27 16:06:16,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1489 conditions, 767 events. 415/767 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3602 event pairs, 312 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 1486. Up to 643 conditions per place. [2024-01-27 16:06:16,400 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 41 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-01-27 16:06:16,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 192 flow [2024-01-27 16:06:16,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:06:16,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:06:16,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-01-27 16:06:16,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2024-01-27 16:06:16,406 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 82 flow. Second operand 3 states and 74 transitions. [2024-01-27 16:06:16,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 192 flow [2024-01-27 16:06:16,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 192 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 16:06:16,409 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 84 flow [2024-01-27 16:06:16,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2024-01-27 16:06:16,410 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2024-01-27 16:06:16,410 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 84 flow [2024-01-27 16:06:16,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-01-27 16:06:16,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:16,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:16,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:06:16,415 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:16,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:16,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1218864957, now seen corresponding path program 1 times [2024-01-27 16:06:16,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:16,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328986383] [2024-01-27 16:06:16,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:16,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:16,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:16,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:16,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328986383] [2024-01-27 16:06:16,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328986383] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:16,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:16,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:06:16,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920487363] [2024-01-27 16:06:16,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:16,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:06:16,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:16,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:06:16,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:06:16,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-01-27 16:06:16,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-01-27 16:06:16,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:16,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-01-27 16:06:16,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:16,936 INFO L124 PetriNetUnfolderBase]: 690/1270 cut-off events. [2024-01-27 16:06:16,936 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-01-27 16:06:16,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2486 conditions, 1270 events. 690/1270 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6368 event pairs, 74 based on Foata normal form. 0/1208 useless extension candidates. Maximal degree in co-relation 2482. Up to 678 conditions per place. [2024-01-27 16:06:16,941 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 73 selfloop transitions, 10 changer transitions 3/93 dead transitions. [2024-01-27 16:06:16,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 93 transitions, 379 flow [2024-01-27 16:06:16,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 16:06:16,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 16:06:16,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-01-27 16:06:16,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2024-01-27 16:06:16,946 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 84 flow. Second operand 6 states and 148 transitions. [2024-01-27 16:06:16,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 93 transitions, 379 flow [2024-01-27 16:06:16,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 93 transitions, 369 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 16:06:16,949 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 148 flow [2024-01-27 16:06:16,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2024-01-27 16:06:16,950 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2024-01-27 16:06:16,951 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 148 flow [2024-01-27 16:06:16,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-01-27 16:06:16,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:16,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:16,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 16:06:16,951 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:16,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:16,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1465531370, now seen corresponding path program 1 times [2024-01-27 16:06:16,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:16,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490422223] [2024-01-27 16:06:16,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:16,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:17,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:17,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490422223] [2024-01-27 16:06:17,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490422223] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:17,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:17,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 16:06:17,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913489533] [2024-01-27 16:06:17,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:17,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:06:17,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:17,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:06:17,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:06:17,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-01-27 16:06:17,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-01-27 16:06:17,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:17,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-01-27 16:06:17,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:17,132 INFO L124 PetriNetUnfolderBase]: 440/850 cut-off events. [2024-01-27 16:06:17,132 INFO L125 PetriNetUnfolderBase]: For 154/157 co-relation queries the response was YES. [2024-01-27 16:06:17,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1755 conditions, 850 events. 440/850 cut-off events. For 154/157 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3776 event pairs, 226 based on Foata normal form. 30/855 useless extension candidates. Maximal degree in co-relation 1748. Up to 437 conditions per place. [2024-01-27 16:06:17,136 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 38 selfloop transitions, 4 changer transitions 4/52 dead transitions. [2024-01-27 16:06:17,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 52 transitions, 225 flow [2024-01-27 16:06:17,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:06:17,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:06:17,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-01-27 16:06:17,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-01-27 16:06:17,137 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 148 flow. Second operand 3 states and 76 transitions. [2024-01-27 16:06:17,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 52 transitions, 225 flow [2024-01-27 16:06:17,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 219 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 16:06:17,140 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 110 flow [2024-01-27 16:06:17,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2024-01-27 16:06:17,141 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2024-01-27 16:06:17,141 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 110 flow [2024-01-27 16:06:17,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-01-27 16:06:17,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:17,142 INFO L208 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-01-27 16:06:17,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 16:06:17,142 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:17,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:17,143 INFO L85 PathProgramCache]: Analyzing trace with hash 372742989, now seen corresponding path program 1 times [2024-01-27 16:06:17,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:17,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981926860] [2024-01-27 16:06:17,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:17,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:17,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:17,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:17,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981926860] [2024-01-27 16:06:17,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981926860] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:17,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:17,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:06:17,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835196100] [2024-01-27 16:06:17,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:17,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:06:17,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:17,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:06:17,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:06:17,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-01-27 16:06:17,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-01-27 16:06:17,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:17,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-01-27 16:06:17,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:17,343 INFO L124 PetriNetUnfolderBase]: 265/581 cut-off events. [2024-01-27 16:06:17,344 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-01-27 16:06:17,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1201 conditions, 581 events. 265/581 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2363 event pairs, 91 based on Foata normal form. 32/602 useless extension candidates. Maximal degree in co-relation 1193. Up to 266 conditions per place. [2024-01-27 16:06:17,347 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 36 selfloop transitions, 6 changer transitions 0/48 dead transitions. [2024-01-27 16:06:17,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 219 flow [2024-01-27 16:06:17,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:06:17,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:06:17,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-01-27 16:06:17,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2024-01-27 16:06:17,349 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 110 flow. Second operand 3 states and 73 transitions. [2024-01-27 16:06:17,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 219 flow [2024-01-27 16:06:17,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 209 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-01-27 16:06:17,352 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 112 flow [2024-01-27 16:06:17,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2024-01-27 16:06:17,354 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2024-01-27 16:06:17,354 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 112 flow [2024-01-27 16:06:17,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-01-27 16:06:17,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:17,354 INFO L208 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] [2024-01-27 16:06:17,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 16:06:17,355 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:17,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:17,356 INFO L85 PathProgramCache]: Analyzing trace with hash -71368257, now seen corresponding path program 1 times [2024-01-27 16:06:17,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:17,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603203044] [2024-01-27 16:06:17,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:17,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:18,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:18,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:18,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603203044] [2024-01-27 16:06:18,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603203044] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:18,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:18,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-27 16:06:18,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004530735] [2024-01-27 16:06:18,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:18,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-27 16:06:18,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:18,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-27 16:06:18,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-01-27 16:06:18,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-01-27 16:06:18,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 112 flow. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-01-27 16:06:18,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:18,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-01-27 16:06:18,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:18,638 INFO L124 PetriNetUnfolderBase]: 384/839 cut-off events. [2024-01-27 16:06:18,639 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2024-01-27 16:06:18,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1827 conditions, 839 events. 384/839 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4112 event pairs, 78 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 1820. Up to 288 conditions per place. [2024-01-27 16:06:18,643 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 68 selfloop transitions, 16 changer transitions 12/102 dead transitions. [2024-01-27 16:06:18,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 102 transitions, 495 flow [2024-01-27 16:06:18,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-27 16:06:18,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-27 16:06:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions. [2024-01-27 16:06:18,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2024-01-27 16:06:18,645 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 112 flow. Second operand 10 states and 196 transitions. [2024-01-27 16:06:18,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 102 transitions, 495 flow [2024-01-27 16:06:18,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 102 transitions, 472 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 16:06:18,647 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 221 flow [2024-01-27 16:06:18,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=221, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2024-01-27 16:06:18,648 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2024-01-27 16:06:18,648 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 221 flow [2024-01-27 16:06:18,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-01-27 16:06:18,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:18,648 INFO L208 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] [2024-01-27 16:06:18,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 16:06:18,649 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:18,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:18,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1053873883, now seen corresponding path program 2 times [2024-01-27 16:06:18,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:18,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091872864] [2024-01-27 16:06:18,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:18,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:19,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:19,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:19,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091872864] [2024-01-27 16:06:19,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091872864] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:19,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:19,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-27 16:06:19,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207523593] [2024-01-27 16:06:19,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:19,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-27 16:06:19,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:19,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-27 16:06:19,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-01-27 16:06:19,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-01-27 16:06:19,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 221 flow. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-01-27 16:06:19,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:19,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-01-27 16:06:19,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:19,768 INFO L124 PetriNetUnfolderBase]: 501/1109 cut-off events. [2024-01-27 16:06:19,768 INFO L125 PetriNetUnfolderBase]: For 871/873 co-relation queries the response was YES. [2024-01-27 16:06:19,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2896 conditions, 1109 events. 501/1109 cut-off events. For 871/873 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 6273 event pairs, 150 based on Foata normal form. 0/1088 useless extension candidates. Maximal degree in co-relation 2882. Up to 661 conditions per place. [2024-01-27 16:06:19,773 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 71 selfloop transitions, 16 changer transitions 6/99 dead transitions. [2024-01-27 16:06:19,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 99 transitions, 599 flow [2024-01-27 16:06:19,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 16:06:19,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 16:06:19,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-01-27 16:06:19,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-01-27 16:06:19,775 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 221 flow. Second operand 9 states and 171 transitions. [2024-01-27 16:06:19,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 99 transitions, 599 flow [2024-01-27 16:06:19,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 99 transitions, 583 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-01-27 16:06:19,779 INFO L231 Difference]: Finished difference. Result has 70 places, 63 transitions, 371 flow [2024-01-27 16:06:19,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=371, PETRI_PLACES=70, PETRI_TRANSITIONS=63} [2024-01-27 16:06:19,780 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places. [2024-01-27 16:06:19,780 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 63 transitions, 371 flow [2024-01-27 16:06:19,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-01-27 16:06:19,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:19,780 INFO L208 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] [2024-01-27 16:06:19,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 16:06:19,780 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:19,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:19,781 INFO L85 PathProgramCache]: Analyzing trace with hash 290882353, now seen corresponding path program 3 times [2024-01-27 16:06:19,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:19,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812026852] [2024-01-27 16:06:19,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:19,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:20,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:20,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:20,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812026852] [2024-01-27 16:06:20,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812026852] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:20,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:20,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-27 16:06:20,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739687279] [2024-01-27 16:06:20,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:20,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-27 16:06:20,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:20,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-27 16:06:20,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-01-27 16:06:20,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-01-27 16:06:20,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 63 transitions, 371 flow. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-01-27 16:06:20,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:20,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-01-27 16:06:20,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:20,845 INFO L124 PetriNetUnfolderBase]: 628/1391 cut-off events. [2024-01-27 16:06:20,845 INFO L125 PetriNetUnfolderBase]: For 1785/1785 co-relation queries the response was YES. [2024-01-27 16:06:20,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3889 conditions, 1391 events. 628/1391 cut-off events. For 1785/1785 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 8105 event pairs, 52 based on Foata normal form. 0/1379 useless extension candidates. Maximal degree in co-relation 3869. Up to 338 conditions per place. [2024-01-27 16:06:20,851 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 93 selfloop transitions, 32 changer transitions 9/140 dead transitions. [2024-01-27 16:06:20,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 140 transitions, 934 flow [2024-01-27 16:06:20,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-01-27 16:06:20,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-01-27 16:06:20,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 237 transitions. [2024-01-27 16:06:20,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4114583333333333 [2024-01-27 16:06:20,853 INFO L175 Difference]: Start difference. First operand has 70 places, 63 transitions, 371 flow. Second operand 12 states and 237 transitions. [2024-01-27 16:06:20,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 140 transitions, 934 flow [2024-01-27 16:06:20,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 140 transitions, 888 flow, removed 23 selfloop flow, removed 0 redundant places. [2024-01-27 16:06:20,862 INFO L231 Difference]: Finished difference. Result has 84 places, 72 transitions, 485 flow [2024-01-27 16:06:20,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=485, PETRI_PLACES=84, PETRI_TRANSITIONS=72} [2024-01-27 16:06:20,863 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 40 predicate places. [2024-01-27 16:06:20,863 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 72 transitions, 485 flow [2024-01-27 16:06:20,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-01-27 16:06:20,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:20,864 INFO L208 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] [2024-01-27 16:06:20,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 16:06:20,864 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:20,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:20,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1405892769, now seen corresponding path program 4 times [2024-01-27 16:06:20,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:20,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612862012] [2024-01-27 16:06:20,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:20,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:21,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:21,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:21,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612862012] [2024-01-27 16:06:21,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612862012] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:21,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:21,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-27 16:06:21,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684783537] [2024-01-27 16:06:21,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:21,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-27 16:06:21,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:21,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-27 16:06:21,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-01-27 16:06:21,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-01-27 16:06:21,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 72 transitions, 485 flow. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-01-27 16:06:21,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:21,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-01-27 16:06:21,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:21,896 INFO L124 PetriNetUnfolderBase]: 722/1599 cut-off events. [2024-01-27 16:06:21,896 INFO L125 PetriNetUnfolderBase]: For 3005/3005 co-relation queries the response was YES. [2024-01-27 16:06:21,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4777 conditions, 1599 events. 722/1599 cut-off events. For 3005/3005 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9830 event pairs, 182 based on Foata normal form. 0/1579 useless extension candidates. Maximal degree in co-relation 4753. Up to 707 conditions per place. [2024-01-27 16:06:21,902 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 90 selfloop transitions, 23 changer transitions 12/131 dead transitions. [2024-01-27 16:06:21,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 131 transitions, 990 flow [2024-01-27 16:06:21,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 16:06:21,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 16:06:21,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2024-01-27 16:06:21,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2024-01-27 16:06:21,904 INFO L175 Difference]: Start difference. First operand has 84 places, 72 transitions, 485 flow. Second operand 9 states and 186 transitions. [2024-01-27 16:06:21,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 131 transitions, 990 flow [2024-01-27 16:06:21,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 131 transitions, 912 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-01-27 16:06:21,914 INFO L231 Difference]: Finished difference. Result has 92 places, 83 transitions, 621 flow [2024-01-27 16:06:21,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=621, PETRI_PLACES=92, PETRI_TRANSITIONS=83} [2024-01-27 16:06:21,915 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 48 predicate places. [2024-01-27 16:06:21,915 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 83 transitions, 621 flow [2024-01-27 16:06:21,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-01-27 16:06:21,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:21,917 INFO L208 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] [2024-01-27 16:06:21,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 16:06:21,918 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:21,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:21,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1651249167, now seen corresponding path program 5 times [2024-01-27 16:06:21,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:21,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476031311] [2024-01-27 16:06:21,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:21,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:22,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:22,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476031311] [2024-01-27 16:06:22,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476031311] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:22,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:22,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-27 16:06:22,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145738715] [2024-01-27 16:06:22,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:22,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-27 16:06:22,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:22,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-27 16:06:22,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-01-27 16:06:22,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-01-27 16:06:22,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 83 transitions, 621 flow. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-01-27 16:06:22,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:22,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-01-27 16:06:22,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:22,952 INFO L124 PetriNetUnfolderBase]: 778/1699 cut-off events. [2024-01-27 16:06:22,952 INFO L125 PetriNetUnfolderBase]: For 3771/3771 co-relation queries the response was YES. [2024-01-27 16:06:22,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5260 conditions, 1699 events. 778/1699 cut-off events. For 3771/3771 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 10474 event pairs, 172 based on Foata normal form. 0/1681 useless extension candidates. Maximal degree in co-relation 5230. Up to 727 conditions per place. [2024-01-27 16:06:22,960 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 92 selfloop transitions, 29 changer transitions 9/136 dead transitions. [2024-01-27 16:06:22,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 136 transitions, 1091 flow [2024-01-27 16:06:22,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-27 16:06:22,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-27 16:06:22,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions. [2024-01-27 16:06:22,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-01-27 16:06:22,961 INFO L175 Difference]: Start difference. First operand has 92 places, 83 transitions, 621 flow. Second operand 10 states and 195 transitions. [2024-01-27 16:06:22,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 136 transitions, 1091 flow [2024-01-27 16:06:22,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 136 transitions, 1010 flow, removed 37 selfloop flow, removed 2 redundant places. [2024-01-27 16:06:22,972 INFO L231 Difference]: Finished difference. Result has 101 places, 87 transitions, 678 flow [2024-01-27 16:06:22,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=678, PETRI_PLACES=101, PETRI_TRANSITIONS=87} [2024-01-27 16:06:22,973 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 57 predicate places. [2024-01-27 16:06:22,973 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 87 transitions, 678 flow [2024-01-27 16:06:22,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-01-27 16:06:22,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:22,974 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:22,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 16:06:22,974 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:22,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:22,974 INFO L85 PathProgramCache]: Analyzing trace with hash -21419035, now seen corresponding path program 1 times [2024-01-27 16:06:22,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:22,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200257034] [2024-01-27 16:06:22,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:22,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:23,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:23,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:23,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200257034] [2024-01-27 16:06:23,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200257034] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:06:23,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073541289] [2024-01-27 16:06:23,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:23,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:06:23,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:06:23,789 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 16:06:23,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-01-27 16:06:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:23,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 32 conjunts are in the unsatisfiable core [2024-01-27 16:06:23,950 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:06:23,992 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 22 treesize of output 21 [2024-01-27 16:06:24,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 128 [2024-01-27 16:06:24,068 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 8 treesize of output 1 [2024-01-27 16:06:24,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-01-27 16:06:24,442 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 82 treesize of output 69 [2024-01-27 16:06:24,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 16:06:24,454 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 55 treesize of output 54 [2024-01-27 16:06:25,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:25,139 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 118 treesize of output 92 [2024-01-27 16:06:25,143 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 96 treesize of output 84 [2024-01-27 16:06:25,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:25,173 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:06:25,413 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:06:25,414 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:06:25,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:25,426 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:06:26,487 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:06:26,487 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:06:26,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:26,497 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:06:27,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-01-27 16:06:27,248 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 24 treesize of output 18 [2024-01-27 16:06:27,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-01-27 16:06:27,261 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 60 treesize of output 54 [2024-01-27 16:06:27,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-01-27 16:06:27,296 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 60 treesize of output 54 [2024-01-27 16:06:27,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-01-27 16:06:27,333 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 24 treesize of output 18 [2024-01-27 16:06:27,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-01-27 16:06:27,345 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 126 treesize of output 114 [2024-01-27 16:06:27,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-01-27 16:06:27,360 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 60 treesize of output 54 [2024-01-27 16:06:27,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:27,522 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:06:27,632 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:06:27,633 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:06:28,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:28,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073541289] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:06:28,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:06:28,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-01-27 16:06:28,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145805652] [2024-01-27 16:06:28,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:06:28,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-01-27 16:06:28,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:28,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-01-27 16:06:28,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2024-01-27 16:06:28,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-01-27 16:06:28,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 87 transitions, 678 flow. Second operand has 28 states, 28 states have (on average 11.535714285714286) internal successors, (323), 28 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:28,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:28,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-01-27 16:06:28,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:31,238 INFO L124 PetriNetUnfolderBase]: 985/2076 cut-off events. [2024-01-27 16:06:31,238 INFO L125 PetriNetUnfolderBase]: For 4427/4429 co-relation queries the response was YES. [2024-01-27 16:06:31,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6412 conditions, 2076 events. 985/2076 cut-off events. For 4427/4429 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 13161 event pairs, 276 based on Foata normal form. 0/2068 useless extension candidates. Maximal degree in co-relation 6380. Up to 1353 conditions per place. [2024-01-27 16:06:31,250 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 117 selfloop transitions, 28 changer transitions 6/156 dead transitions. [2024-01-27 16:06:31,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 156 transitions, 1232 flow [2024-01-27 16:06:31,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-27 16:06:31,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-01-27 16:06:31,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 227 transitions. [2024-01-27 16:06:31,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36378205128205127 [2024-01-27 16:06:31,252 INFO L175 Difference]: Start difference. First operand has 101 places, 87 transitions, 678 flow. Second operand 13 states and 227 transitions. [2024-01-27 16:06:31,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 156 transitions, 1232 flow [2024-01-27 16:06:31,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 156 transitions, 1160 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-01-27 16:06:31,263 INFO L231 Difference]: Finished difference. Result has 110 places, 99 transitions, 783 flow [2024-01-27 16:06:31,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=783, PETRI_PLACES=110, PETRI_TRANSITIONS=99} [2024-01-27 16:06:31,264 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 66 predicate places. [2024-01-27 16:06:31,264 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 99 transitions, 783 flow [2024-01-27 16:06:31,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.535714285714286) internal successors, (323), 28 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:31,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:31,265 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:31,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-01-27 16:06:31,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-01-27 16:06:31,469 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:31,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:31,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1603306455, now seen corresponding path program 2 times [2024-01-27 16:06:31,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:31,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089609552] [2024-01-27 16:06:31,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:31,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:32,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:32,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:32,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089609552] [2024-01-27 16:06:32,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089609552] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:06:32,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115227306] [2024-01-27 16:06:32,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 16:06:32,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:06:32,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:06:32,289 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 16:06:32,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-27 16:06:32,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 16:06:32,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:06:32,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 49 conjunts are in the unsatisfiable core [2024-01-27 16:06:32,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:06:32,515 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 16 treesize of output 15 [2024-01-27 16:06:32,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 109 [2024-01-27 16:06:32,582 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-01-27 16:06:32,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 16:06:32,851 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 42 treesize of output 41 [2024-01-27 16:06:32,856 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 62 treesize of output 49 [2024-01-27 16:06:33,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:33,388 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 100 treesize of output 74 [2024-01-27 16:06:33,391 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 74 treesize of output 62 [2024-01-27 16:06:33,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:33,413 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:06:33,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:33,605 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:06:33,617 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:06:33,618 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:06:34,474 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:06:34,474 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:06:34,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:34,485 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:06:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:36,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115227306] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:06:36,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:06:36,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-01-27 16:06:36,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175321488] [2024-01-27 16:06:36,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:06:36,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-01-27 16:06:36,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:36,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-01-27 16:06:36,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2024-01-27 16:06:37,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 48 [2024-01-27 16:06:37,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 99 transitions, 783 flow. Second operand has 28 states, 28 states have (on average 10.75) internal successors, (301), 28 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:37,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:37,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 48 [2024-01-27 16:06:37,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:41,243 INFO L124 PetriNetUnfolderBase]: 1695/3319 cut-off events. [2024-01-27 16:06:41,244 INFO L125 PetriNetUnfolderBase]: For 8946/8946 co-relation queries the response was YES. [2024-01-27 16:06:41,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11193 conditions, 3319 events. 1695/3319 cut-off events. For 8946/8946 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 20645 event pairs, 366 based on Foata normal form. 0/3299 useless extension candidates. Maximal degree in co-relation 11157. Up to 1357 conditions per place. [2024-01-27 16:06:41,262 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 173 selfloop transitions, 43 changer transitions 11/231 dead transitions. [2024-01-27 16:06:41,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 231 transitions, 1870 flow [2024-01-27 16:06:41,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-01-27 16:06:41,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-01-27 16:06:41,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 299 transitions. [2024-01-27 16:06:41,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3893229166666667 [2024-01-27 16:06:41,267 INFO L175 Difference]: Start difference. First operand has 110 places, 99 transitions, 783 flow. Second operand 16 states and 299 transitions. [2024-01-27 16:06:41,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 231 transitions, 1870 flow [2024-01-27 16:06:41,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 231 transitions, 1819 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-01-27 16:06:41,288 INFO L231 Difference]: Finished difference. Result has 127 places, 120 transitions, 1093 flow [2024-01-27 16:06:41,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1093, PETRI_PLACES=127, PETRI_TRANSITIONS=120} [2024-01-27 16:06:41,289 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 83 predicate places. [2024-01-27 16:06:41,289 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 120 transitions, 1093 flow [2024-01-27 16:06:41,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.75) internal successors, (301), 28 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:41,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:41,289 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:41,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-27 16:06:41,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-01-27 16:06:41,502 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:41,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:41,502 INFO L85 PathProgramCache]: Analyzing trace with hash -963818937, now seen corresponding path program 3 times [2024-01-27 16:06:41,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:41,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887953891] [2024-01-27 16:06:41,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:41,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:42,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:42,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:42,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887953891] [2024-01-27 16:06:42,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887953891] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:06:42,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378517766] [2024-01-27 16:06:42,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 16:06:42,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:06:42,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:06:42,735 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 16:06:42,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-27 16:06:42,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-01-27 16:06:42,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:06:42,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 38 conjunts are in the unsatisfiable core [2024-01-27 16:06:42,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:06:42,990 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 16 treesize of output 15 [2024-01-27 16:06:43,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 96 [2024-01-27 16:06:43,071 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-01-27 16:06:43,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 16:06:43,338 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 42 treesize of output 41 [2024-01-27 16:06:43,341 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 62 treesize of output 49 [2024-01-27 16:06:43,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:43,864 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 100 treesize of output 74 [2024-01-27 16:06:43,866 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 74 treesize of output 62 [2024-01-27 16:06:43,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:43,894 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:06:44,100 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:06:44,101 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:06:44,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:44,111 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:06:44,986 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:06:44,987 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:06:44,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:44,997 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:06:46,238 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 30 treesize of output 18 [2024-01-27 16:06:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:46,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378517766] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:06:46,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:06:46,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-01-27 16:06:46,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347375561] [2024-01-27 16:06:46,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:06:46,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-01-27 16:06:46,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:46,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-01-27 16:06:46,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2024-01-27 16:06:47,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-01-27 16:06:47,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 120 transitions, 1093 flow. Second operand has 28 states, 28 states have (on average 11.535714285714286) internal successors, (323), 28 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:47,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:47,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-01-27 16:06:47,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:54,027 INFO L124 PetriNetUnfolderBase]: 1696/3472 cut-off events. [2024-01-27 16:06:54,027 INFO L125 PetriNetUnfolderBase]: For 16988/16990 co-relation queries the response was YES. [2024-01-27 16:06:54,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13504 conditions, 3472 events. 1696/3472 cut-off events. For 16988/16990 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 23011 event pairs, 166 based on Foata normal form. 36/3484 useless extension candidates. Maximal degree in co-relation 13459. Up to 607 conditions per place. [2024-01-27 16:06:54,046 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 187 selfloop transitions, 100 changer transitions 8/300 dead transitions. [2024-01-27 16:06:54,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 300 transitions, 2795 flow [2024-01-27 16:06:54,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-01-27 16:06:54,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-01-27 16:06:54,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 412 transitions. [2024-01-27 16:06:54,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39015151515151514 [2024-01-27 16:06:54,050 INFO L175 Difference]: Start difference. First operand has 127 places, 120 transitions, 1093 flow. Second operand 22 states and 412 transitions. [2024-01-27 16:06:54,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 300 transitions, 2795 flow [2024-01-27 16:06:54,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 300 transitions, 2683 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-01-27 16:06:54,081 INFO L231 Difference]: Finished difference. Result has 155 places, 156 transitions, 1758 flow [2024-01-27 16:06:54,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=993, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1758, PETRI_PLACES=155, PETRI_TRANSITIONS=156} [2024-01-27 16:06:54,082 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 111 predicate places. [2024-01-27 16:06:54,082 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 156 transitions, 1758 flow [2024-01-27 16:06:54,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.535714285714286) internal successors, (323), 28 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:54,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:54,083 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:54,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-27 16:06:54,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:06:54,295 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:54,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:54,296 INFO L85 PathProgramCache]: Analyzing trace with hash -378291667, now seen corresponding path program 4 times [2024-01-27 16:06:54,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:54,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331867723] [2024-01-27 16:06:54,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:54,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:55,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:55,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:55,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331867723] [2024-01-27 16:06:55,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331867723] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:06:55,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942197987] [2024-01-27 16:06:55,595 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 16:06:55,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:06:55,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:06:55,596 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 16:06:55,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-27 16:06:55,743 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 16:06:55,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:06:55,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 40 conjunts are in the unsatisfiable core [2024-01-27 16:06:55,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:06:55,761 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 16 treesize of output 15 [2024-01-27 16:06:55,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 96 [2024-01-27 16:06:55,836 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-01-27 16:06:56,050 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 62 treesize of output 49 [2024-01-27 16:06:56,056 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 41 treesize of output 40 [2024-01-27 16:06:56,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:56,576 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 1 case distinctions, treesize of input 85 treesize of output 61 [2024-01-27 16:06:56,577 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 71 treesize of output 59 [2024-01-27 16:06:56,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:56,607 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:06:56,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:56,816 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:06:56,824 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:06:56,825 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:06:57,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:57,920 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:06:57,930 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:06:57,930 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:06:58,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:58,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 3056 treesize of output 1746 [2024-01-27 16:06:59,984 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-01-27 16:07:00,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:00,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942197987] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:07:00,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:07:00,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-01-27 16:07:00,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116934588] [2024-01-27 16:07:00,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:07:00,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-01-27 16:07:00,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:00,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-01-27 16:07:00,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2024-01-27 16:07:00,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-01-27 16:07:00,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 156 transitions, 1758 flow. Second operand has 28 states, 28 states have (on average 11.535714285714286) internal successors, (323), 28 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:00,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:00,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-01-27 16:07:00,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:09,938 INFO L124 PetriNetUnfolderBase]: 3150/6303 cut-off events. [2024-01-27 16:07:09,938 INFO L125 PetriNetUnfolderBase]: For 69569/69571 co-relation queries the response was YES. [2024-01-27 16:07:09,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31965 conditions, 6303 events. 3150/6303 cut-off events. For 69569/69571 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 45365 event pairs, 266 based on Foata normal form. 118/6373 useless extension candidates. Maximal degree in co-relation 31906. Up to 1087 conditions per place. [2024-01-27 16:07:09,981 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 289 selfloop transitions, 185 changer transitions 3/482 dead transitions. [2024-01-27 16:07:09,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 482 transitions, 6047 flow [2024-01-27 16:07:09,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-01-27 16:07:09,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2024-01-27 16:07:09,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 552 transitions. [2024-01-27 16:07:09,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39655172413793105 [2024-01-27 16:07:09,984 INFO L175 Difference]: Start difference. First operand has 155 places, 156 transitions, 1758 flow. Second operand 29 states and 552 transitions. [2024-01-27 16:07:09,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 482 transitions, 6047 flow [2024-01-27 16:07:10,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 482 transitions, 5698 flow, removed 149 selfloop flow, removed 9 redundant places. [2024-01-27 16:07:10,098 INFO L231 Difference]: Finished difference. Result has 189 places, 267 transitions, 3920 flow [2024-01-27 16:07:10,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=3920, PETRI_PLACES=189, PETRI_TRANSITIONS=267} [2024-01-27 16:07:10,099 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 145 predicate places. [2024-01-27 16:07:10,099 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 267 transitions, 3920 flow [2024-01-27 16:07:10,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.535714285714286) internal successors, (323), 28 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:10,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:10,100 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:10,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-01-27 16:07:10,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:10,312 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:07:10,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:10,313 INFO L85 PathProgramCache]: Analyzing trace with hash -984743489, now seen corresponding path program 5 times [2024-01-27 16:07:10,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:10,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673252510] [2024-01-27 16:07:10,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:10,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:11,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:11,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:11,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673252510] [2024-01-27 16:07:11,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673252510] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:07:11,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538926941] [2024-01-27 16:07:11,020 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 16:07:11,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:11,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:11,021 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 16:07:11,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-01-27 16:07:11,230 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 16:07:11,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:07:11,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 44 conjunts are in the unsatisfiable core [2024-01-27 16:07:11,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:07:11,253 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 16 treesize of output 15 [2024-01-27 16:07:11,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 109 [2024-01-27 16:07:11,312 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 31 treesize of output 20 [2024-01-27 16:07:11,356 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-01-27 16:07:11,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 116 [2024-01-27 16:07:11,483 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 8 treesize of output 1 [2024-01-27 16:07:11,487 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 41 treesize of output 40 [2024-01-27 16:07:11,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:07:11,742 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 1 case distinctions, treesize of input 57 treesize of output 37 [2024-01-27 16:07:11,744 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 59 treesize of output 45 [2024-01-27 16:07:11,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:11,758 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:07:12,041 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:07:12,041 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:07:12,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:07:12,056 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:07:12,860 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:07:12,860 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:07:12,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:07:12,869 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:07:13,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-01-27 16:07:13,569 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 24 treesize of output 18 [2024-01-27 16:07:13,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-01-27 16:07:13,578 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 24 treesize of output 18 [2024-01-27 16:07:13,603 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 20 treesize of output 18 [2024-01-27 16:07:13,606 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 52 treesize of output 46 [2024-01-27 16:07:13,639 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 20 treesize of output 18 [2024-01-27 16:07:13,643 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 52 treesize of output 46 [2024-01-27 16:07:13,692 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 20 treesize of output 18 [2024-01-27 16:07:13,699 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 114 treesize of output 102 [2024-01-27 16:07:15,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:15,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538926941] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:07:15,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:07:15,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-01-27 16:07:15,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846392680] [2024-01-27 16:07:15,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:07:15,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-01-27 16:07:15,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:15,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-01-27 16:07:15,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2024-01-27 16:07:15,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-01-27 16:07:15,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 267 transitions, 3920 flow. Second operand has 28 states, 28 states have (on average 11.535714285714286) internal successors, (323), 28 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:15,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:15,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-01-27 16:07:15,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:18,922 INFO L124 PetriNetUnfolderBase]: 3513/6962 cut-off events. [2024-01-27 16:07:18,922 INFO L125 PetriNetUnfolderBase]: For 160763/160763 co-relation queries the response was YES. [2024-01-27 16:07:18,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44478 conditions, 6962 events. 3513/6962 cut-off events. For 160763/160763 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 50561 event pairs, 370 based on Foata normal form. 18/6931 useless extension candidates. Maximal degree in co-relation 44402. Up to 3809 conditions per place. [2024-01-27 16:07:18,985 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 308 selfloop transitions, 114 changer transitions 9/436 dead transitions. [2024-01-27 16:07:18,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 436 transitions, 6865 flow [2024-01-27 16:07:18,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-01-27 16:07:18,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-01-27 16:07:18,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 315 transitions. [2024-01-27 16:07:18,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-01-27 16:07:18,987 INFO L175 Difference]: Start difference. First operand has 189 places, 267 transitions, 3920 flow. Second operand 18 states and 315 transitions. [2024-01-27 16:07:18,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 436 transitions, 6865 flow [2024-01-27 16:07:19,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 436 transitions, 5893 flow, removed 442 selfloop flow, removed 11 redundant places. [2024-01-27 16:07:19,301 INFO L231 Difference]: Finished difference. Result has 203 places, 334 transitions, 4734 flow [2024-01-27 16:07:19,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3341, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4734, PETRI_PLACES=203, PETRI_TRANSITIONS=334} [2024-01-27 16:07:19,302 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 159 predicate places. [2024-01-27 16:07:19,302 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 334 transitions, 4734 flow [2024-01-27 16:07:19,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.535714285714286) internal successors, (323), 28 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:19,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:19,302 INFO L208 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] [2024-01-27 16:07:19,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-01-27 16:07:19,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-01-27 16:07:19,504 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:07:19,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:19,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1038284311, now seen corresponding path program 1 times [2024-01-27 16:07:19,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:19,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664214221] [2024-01-27 16:07:19,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:19,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:07:19,560 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 16:07:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:07:19,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 16:07:19,599 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 16:07:19,605 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-01-27 16:07:19,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-01-27 16:07:19,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-01-27 16:07:19,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-01-27 16:07:19,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2024-01-27 16:07:19,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-01-27 16:07:19,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-01-27 16:07:19,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-27 16:07:19,607 INFO L445 BasicCegarLoop]: Path program histogram: [5, 5, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:19,611 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 16:07:19,612 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 16:07:19,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 04:07:19 BasicIcfg [2024-01-27 16:07:19,677 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 16:07:19,678 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 16:07:19,678 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 16:07:19,678 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 16:07:19,678 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:06:15" (3/4) ... [2024-01-27 16:07:19,679 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-01-27 16:07:19,745 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 16:07:19,745 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 16:07:19,746 INFO L158 Benchmark]: Toolchain (without parser) took 65630.32ms. Allocated memory was 146.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 77.3MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2024-01-27 16:07:19,746 INFO L158 Benchmark]: CDTParser took 0.62ms. Allocated memory is still 146.8MB. Free memory is still 107.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:07:19,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 568.27ms. Allocated memory is still 146.8MB. Free memory was 77.1MB in the beginning and 101.1MB in the end (delta: -24.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-01-27 16:07:19,747 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.39ms. Allocated memory is still 146.8MB. Free memory was 101.1MB in the beginning and 97.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 16:07:19,747 INFO L158 Benchmark]: Boogie Preprocessor took 43.01ms. Allocated memory is still 146.8MB. Free memory was 97.6MB in the beginning and 94.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 16:07:19,748 INFO L158 Benchmark]: RCFGBuilder took 686.27ms. Allocated memory is still 146.8MB. Free memory was 94.1MB in the beginning and 87.1MB in the end (delta: 7.0MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2024-01-27 16:07:19,752 INFO L158 Benchmark]: TraceAbstraction took 64192.38ms. Allocated memory was 146.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 87.1MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-01-27 16:07:19,752 INFO L158 Benchmark]: Witness Printer took 67.69ms. Allocated memory is still 1.4GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-01-27 16:07:19,753 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.62ms. Allocated memory is still 146.8MB. Free memory is still 107.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 568.27ms. Allocated memory is still 146.8MB. Free memory was 77.1MB in the beginning and 101.1MB in the end (delta: -24.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.39ms. Allocated memory is still 146.8MB. Free memory was 101.1MB in the beginning and 97.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.01ms. Allocated memory is still 146.8MB. Free memory was 97.6MB in the beginning and 94.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 686.27ms. Allocated memory is still 146.8MB. Free memory was 94.1MB in the beginning and 87.1MB in the end (delta: 7.0MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. * TraceAbstraction took 64192.38ms. Allocated memory was 146.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 87.1MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Witness Printer took 67.69ms. Allocated memory is still 1.4GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1043]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L949] 0 int stored_elements[(400)]; [L949] 0 int stored_elements[(400)]; [L950] 0 _Bool enqueue_flag, dequeue_flag; [L951] 0 QType queue; [L951] 0 QType queue; [L1054] 0 pthread_t id1, id2; [L1055] 0 enqueue_flag=(1) [L1056] 0 dequeue_flag=(0) [L1057] CALL 0 init(&queue) [L954] 0 q->head=0 [L955] 0 q->tail=0 [L956] 0 q->amount=0 [L1057] RET 0 init(&queue) [L1058] CALL, EXPR 0 empty(&queue) [L960] EXPR 0 q->head [L960] EXPR 0 q->tail [L960] COND TRUE 0 q->head == q->tail [L963] 0 return (-1); [L1058] RET, EXPR 0 empty(&queue) [L1058] COND FALSE 0 !(!empty(&queue)==(-1)) [L1062] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1={7:0}, id2={6:0}, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1007] 1 int value, i; VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1063] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1={7:0}, id2={6:0}, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1036] 2 int i; [L1037] 2 i=0 VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] COND TRUE 2 i<(400) VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] 2 i++ VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1009] 1 value = __VERIFIER_nondet_int() [L1010] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (400)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1010] RET 1 enqueue(&queue,value) [L1010] COND FALSE 1 !(enqueue(&queue,value)) [L1013] 1 stored_elements[0]=value [L1014] CALL 1 empty(&queue) [L960] EXPR 1 q->head [L960] EXPR 1 q->tail [L960] COND FALSE 1 !(q->head == q->tail) [L966] 1 return 0; [L1014] RET 1 empty(&queue) [L1014] COND FALSE 1 !(empty(&queue)) [L1018] 1 i=0 VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=9] [L1018] COND TRUE 1 i<((400)-1) VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=9] [L1021] COND TRUE 1 \read(enqueue_flag) [L1023] 1 value = __VERIFIER_nondet_int() [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (400)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value [L1026] 1 enqueue_flag=(0) [L1027] 1 dequeue_flag=(1) VAL [arg={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L1037] COND TRUE 2 i<(400) VAL [arg={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1040] COND TRUE 2 \read(dequeue_flag) [L1042] CALL, EXPR 2 dequeue(&queue) [L994] 2 int x; [L995] EXPR 2 q->head [L995] EXPR 2 q->element[q->head] [L995] 2 x = q->element[q->head] [L996] EXPR 2 q->amount [L996] 2 q->amount-- [L996] 2 q->amount-- [L997] EXPR 2 q->head [L997] COND FALSE 2 !(q->head == (400)) [L1002] EXPR 2 q->head [L1002] 2 q->head++ [L1002] 2 q->head++ [L1003] 2 return x; [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1042] COND TRUE 2 !dequeue(&queue)==stored_elements[i] [L1043] 2 reach_error() VAL [arg={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] - UnprovableResult [Line: 1059]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 72 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 64.0s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 31.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1849 SdHoareTripleChecker+Valid, 21.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1807 mSDsluCounter, 1118 SdHoareTripleChecker+Invalid, 20.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1092 mSDsCounter, 132 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9951 IncrementalHoareTripleChecker+Invalid, 10084 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 132 mSolverCounterUnsat, 26 mSDtfsCounter, 9951 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 458 GetRequests, 209 SyntacticMatches, 4 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2094 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4734occurred in iteration=15, InterpolantAutomatonStates: 165, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 29.5s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 588 ConstructedInterpolants, 129 QuantifiedInterpolants, 97184 SizeOfPredicates, 206 NumberOfNonLiveVariables, 1400 ConjunctsInSsa, 203 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 0/60 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-27 16:07:19,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE