./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c -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 ceb2af5016fd0ad74653237fbc44a2b3541e4ff971325e3807dab6f19c05af6d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 19:29:20,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 19:29:20,549 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 19:29:20,553 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 19:29:20,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 19:29:20,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 19:29:20,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 19:29:20,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 19:29:20,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 19:29:20,576 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 19:29:20,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 19:29:20,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 19:29:20,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 19:29:20,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 19:29:20,578 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 19:29:20,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 19:29:20,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 19:29:20,579 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 19:29:20,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 19:29:20,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 19:29:20,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 19:29:20,583 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 19:29:20,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 19:29:20,583 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 19:29:20,584 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 19:29:20,584 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 19:29:20,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 19:29:20,585 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 19:29:20,585 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 19:29:20,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 19:29:20,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 19:29:20,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 19:29:20,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:29:20,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 19:29:20,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 19:29:20,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 19:29:20,591 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 19:29:20,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 19:29:20,591 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 19:29:20,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 19:29:20,591 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 19:29:20,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 19:29:20,592 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 -> ceb2af5016fd0ad74653237fbc44a2b3541e4ff971325e3807dab6f19c05af6d [2024-11-16 19:29:20,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 19:29:20,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 19:29:20,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 19:29:20,844 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 19:29:20,845 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 19:29:20,846 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c [2024-11-16 19:29:22,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 19:29:22,436 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 19:29:22,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c [2024-11-16 19:29:22,444 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de34b9570/660f24f3d3394079bd958f90cd4163c8/FLAG207dc5b8a [2024-11-16 19:29:22,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de34b9570/660f24f3d3394079bd958f90cd4163c8 [2024-11-16 19:29:22,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 19:29:22,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 19:29:22,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 19:29:22,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 19:29:22,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 19:29:22,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:29:22" (1/1) ... [2024-11-16 19:29:22,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53aa1c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:29:22, skipping insertion in model container [2024-11-16 19:29:22,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:29:22" (1/1) ... [2024-11-16 19:29:22,494 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 19:29:22,695 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c[3463,3476] [2024-11-16 19:29:22,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:29:22,714 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 19:29:22,745 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c[3463,3476] [2024-11-16 19:29:22,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:29:22,765 INFO L204 MainTranslator]: Completed translation [2024-11-16 19:29:22,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:29:22 WrapperNode [2024-11-16 19:29:22,766 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 19:29:22,767 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 19:29:22,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 19:29:22,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 19:29:22,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:29:22" (1/1) ... [2024-11-16 19:29:22,782 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:29:22" (1/1) ... [2024-11-16 19:29:22,808 INFO L138 Inliner]: procedures = 24, calls = 40, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 234 [2024-11-16 19:29:22,808 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 19:29:22,809 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 19:29:22,809 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 19:29:22,809 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 19:29:22,819 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:29:22" (1/1) ... [2024-11-16 19:29:22,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:29:22" (1/1) ... [2024-11-16 19:29:22,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:29:22" (1/1) ... [2024-11-16 19:29:22,839 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-11-16 19:29:22,840 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:29:22" (1/1) ... [2024-11-16 19:29:22,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:29:22" (1/1) ... [2024-11-16 19:29:22,848 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:29:22" (1/1) ... [2024-11-16 19:29:22,849 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:29:22" (1/1) ... [2024-11-16 19:29:22,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:29:22" (1/1) ... [2024-11-16 19:29:22,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:29:22" (1/1) ... [2024-11-16 19:29:22,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 19:29:22,855 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 19:29:22,855 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 19:29:22,855 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 19:29:22,856 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:29:22" (1/1) ... [2024-11-16 19:29:22,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:29:22,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:29:22,892 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-11-16 19:29:22,894 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-11-16 19:29:22,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 19:29:22,932 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-16 19:29:22,932 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-16 19:29:22,932 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-16 19:29:22,932 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-16 19:29:22,932 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-16 19:29:22,933 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-16 19:29:22,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 19:29:22,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 19:29:22,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 19:29:22,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 19:29:22,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-16 19:29:22,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-16 19:29:22,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 19:29:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 19:29:22,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 19:29:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 19:29:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 19:29:22,935 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 19:29:23,046 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 19:29:23,049 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 19:29:23,423 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 19:29:23,423 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 19:29:23,704 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 19:29:23,705 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 19:29:23,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:29:23 BoogieIcfgContainer [2024-11-16 19:29:23,706 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 19:29:23,710 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 19:29:23,710 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 19:29:23,714 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 19:29:23,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:29:22" (1/3) ... [2024-11-16 19:29:23,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@358f8fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:29:23, skipping insertion in model container [2024-11-16 19:29:23,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:29:22" (2/3) ... [2024-11-16 19:29:23,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@358f8fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:29:23, skipping insertion in model container [2024-11-16 19:29:23,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:29:23" (3/3) ... [2024-11-16 19:29:23,716 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-horseshoe.wvr.c [2024-11-16 19:29:23,732 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 19:29:23,733 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 19:29:23,733 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 19:29:23,784 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-16 19:29:23,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 57 transitions, 135 flow [2024-11-16 19:29:23,859 INFO L124 PetriNetUnfolderBase]: 12/54 cut-off events. [2024-11-16 19:29:23,860 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-16 19:29:23,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 54 events. 12/54 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 96 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 40. Up to 3 conditions per place. [2024-11-16 19:29:23,863 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 57 transitions, 135 flow [2024-11-16 19:29:23,866 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 53 transitions, 124 flow [2024-11-16 19:29:23,874 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 19:29:23,880 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@3f6a30f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 19:29:23,880 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-16 19:29:23,894 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 19:29:23,894 INFO L124 PetriNetUnfolderBase]: 12/52 cut-off events. [2024-11-16 19:29:23,894 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-16 19:29:23,894 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:29:23,895 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:29:23,895 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-16 19:29:23,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:29:23,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1367699296, now seen corresponding path program 1 times [2024-11-16 19:29:23,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:29:23,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549254767] [2024-11-16 19:29:23,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:29:23,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:29:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:29:24,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:29:24,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:29:24,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549254767] [2024-11-16 19:29:24,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549254767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:29:24,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:29:24,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 19:29:24,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908325473] [2024-11-16 19:29:24,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:29:24,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 19:29:24,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:29:24,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 19:29:24,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 19:29:24,170 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 57 [2024-11-16 19:29:24,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 53 transitions, 124 flow. Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:29:24,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:29:24,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 57 [2024-11-16 19:29:24,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:29:24,453 INFO L124 PetriNetUnfolderBase]: 621/1123 cut-off events. [2024-11-16 19:29:24,453 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2024-11-16 19:29:24,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2051 conditions, 1123 events. 621/1123 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6041 event pairs, 493 based on Foata normal form. 264/1254 useless extension candidates. Maximal degree in co-relation 1882. Up to 837 conditions per place. [2024-11-16 19:29:24,494 INFO L140 encePairwiseOnDemand]: 50/57 looper letters, 27 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2024-11-16 19:29:24,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 46 transitions, 164 flow [2024-11-16 19:29:24,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 19:29:24,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-16 19:29:24,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 78 transitions. [2024-11-16 19:29:24,512 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6842105263157895 [2024-11-16 19:29:24,515 INFO L175 Difference]: Start difference. First operand has 51 places, 53 transitions, 124 flow. Second operand 2 states and 78 transitions. [2024-11-16 19:29:24,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 46 transitions, 164 flow [2024-11-16 19:29:24,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 152 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-16 19:29:24,522 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 98 flow [2024-11-16 19:29:24,525 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=98, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2024-11-16 19:29:24,529 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2024-11-16 19:29:24,529 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 98 flow [2024-11-16 19:29:24,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:29:24,530 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:29:24,530 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:29:24,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 19:29:24,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-16 19:29:24,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:29:24,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1534249997, now seen corresponding path program 1 times [2024-11-16 19:29:24,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:29:24,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315548364] [2024-11-16 19:29:24,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:29:24,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:29:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:29:24,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:29:24,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:29:24,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315548364] [2024-11-16 19:29:24,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315548364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:29:24,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:29:24,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 19:29:24,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739254788] [2024-11-16 19:29:24,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:29:24,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:29:24,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:29:24,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:29:24,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:29:24,799 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 57 [2024-11-16 19:29:24,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:29:24,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:29:24,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 57 [2024-11-16 19:29:24,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:29:24,980 INFO L124 PetriNetUnfolderBase]: 589/1157 cut-off events. [2024-11-16 19:29:24,981 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-16 19:29:24,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2029 conditions, 1157 events. 589/1157 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6465 event pairs, 194 based on Foata normal form. 24/1085 useless extension candidates. Maximal degree in co-relation 2026. Up to 555 conditions per place. [2024-11-16 19:29:24,989 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 37 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2024-11-16 19:29:24,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 202 flow [2024-11-16 19:29:24,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:29:24,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:29:24,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-11-16 19:29:24,994 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6198830409356725 [2024-11-16 19:29:24,994 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 98 flow. Second operand 3 states and 106 transitions. [2024-11-16 19:29:24,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 58 transitions, 202 flow [2024-11-16 19:29:24,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 202 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 19:29:25,001 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 110 flow [2024-11-16 19:29:25,001 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2024-11-16 19:29:25,002 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2024-11-16 19:29:25,002 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 110 flow [2024-11-16 19:29:25,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:29:25,003 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:29:25,003 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:29:25,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 19:29:25,004 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-16 19:29:25,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:29:25,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1635018521, now seen corresponding path program 2 times [2024-11-16 19:29:25,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:29:25,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945938604] [2024-11-16 19:29:25,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:29:25,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:29:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:29:25,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:29:25,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:29:25,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945938604] [2024-11-16 19:29:25,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945938604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:29:25,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:29:25,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 19:29:25,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522319100] [2024-11-16 19:29:25,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:29:25,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 19:29:25,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:29:25,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 19:29:25,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 19:29:25,251 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 57 [2024-11-16 19:29:25,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:29:25,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:29:25,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 57 [2024-11-16 19:29:25,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:29:25,484 INFO L124 PetriNetUnfolderBase]: 618/1238 cut-off events. [2024-11-16 19:29:25,484 INFO L125 PetriNetUnfolderBase]: For 87/97 co-relation queries the response was YES. [2024-11-16 19:29:25,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2338 conditions, 1238 events. 618/1238 cut-off events. For 87/97 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6829 event pairs, 477 based on Foata normal form. 30/1175 useless extension candidates. Maximal degree in co-relation 2333. Up to 836 conditions per place. [2024-11-16 19:29:25,492 INFO L140 encePairwiseOnDemand]: 49/57 looper letters, 29 selfloop transitions, 2 changer transitions 17/65 dead transitions. [2024-11-16 19:29:25,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 245 flow [2024-11-16 19:29:25,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 19:29:25,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-16 19:29:25,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2024-11-16 19:29:25,494 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2024-11-16 19:29:25,494 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 110 flow. Second operand 5 states and 150 transitions. [2024-11-16 19:29:25,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 245 flow [2024-11-16 19:29:25,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 243 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 19:29:25,497 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 130 flow [2024-11-16 19:29:25,497 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2024-11-16 19:29:25,498 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2024-11-16 19:29:25,498 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 130 flow [2024-11-16 19:29:25,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:29:25,499 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:29:25,499 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:29:25,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 19:29:25,500 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-16 19:29:25,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:29:25,500 INFO L85 PathProgramCache]: Analyzing trace with hash 695676404, now seen corresponding path program 1 times [2024-11-16 19:29:25,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:29:25,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49680669] [2024-11-16 19:29:25,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:29:25,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:29:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:29:25,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 19:29:25,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:29:25,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49680669] [2024-11-16 19:29:25,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49680669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:29:25,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:29:25,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:29:25,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379985163] [2024-11-16 19:29:25,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:29:25,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 19:29:25,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:29:25,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 19:29:25,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 19:29:25,673 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 57 [2024-11-16 19:29:25,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:29:25,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:29:25,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 57 [2024-11-16 19:29:25,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:29:25,888 INFO L124 PetriNetUnfolderBase]: 757/1487 cut-off events. [2024-11-16 19:29:25,888 INFO L125 PetriNetUnfolderBase]: For 361/371 co-relation queries the response was YES. [2024-11-16 19:29:25,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3053 conditions, 1487 events. 757/1487 cut-off events. For 361/371 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 8753 event pairs, 598 based on Foata normal form. 32/1414 useless extension candidates. Maximal degree in co-relation 3045. Up to 833 conditions per place. [2024-11-16 19:29:25,898 INFO L140 encePairwiseOnDemand]: 50/57 looper letters, 28 selfloop transitions, 4 changer transitions 17/66 dead transitions. [2024-11-16 19:29:25,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 66 transitions, 278 flow [2024-11-16 19:29:25,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 19:29:25,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-16 19:29:25,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2024-11-16 19:29:25,900 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5228070175438596 [2024-11-16 19:29:25,900 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 130 flow. Second operand 5 states and 149 transitions. [2024-11-16 19:29:25,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 66 transitions, 278 flow [2024-11-16 19:29:25,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 66 transitions, 268 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-16 19:29:25,903 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 148 flow [2024-11-16 19:29:25,903 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2024-11-16 19:29:25,904 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2024-11-16 19:29:25,904 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 148 flow [2024-11-16 19:29:25,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:29:25,905 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:29:25,905 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:29:25,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 19:29:25,905 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-16 19:29:25,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:29:25,906 INFO L85 PathProgramCache]: Analyzing trace with hash 470361758, now seen corresponding path program 1 times [2024-11-16 19:29:25,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:29:25,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302932056] [2024-11-16 19:29:25,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:29:25,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:29:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:29:27,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:29:27,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:29:27,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302932056] [2024-11-16 19:29:27,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302932056] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:29:27,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827035651] [2024-11-16 19:29:27,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:29:27,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:29:27,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:29:27,647 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-11-16 19:29:27,649 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-11-16 19:29:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:29:27,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-16 19:29:27,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:29:27,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 23 treesize of output 1 [2024-11-16 19:29:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 19:29:28,898 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:29:30,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 19:29:30,230 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 194 treesize of output 188 [2024-11-16 19:29:30,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 19:29:30,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2024-11-16 19:29:30,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 19:29:30,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 267 treesize of output 316 [2024-11-16 19:29:31,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 19:29:31,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827035651] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:29:31,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:29:31,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 37 [2024-11-16 19:29:31,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926984383] [2024-11-16 19:29:31,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:29:31,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-16 19:29:31,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:29:31,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-16 19:29:31,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1277, Unknown=0, NotChecked=0, Total=1406 [2024-11-16 19:29:31,756 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2024-11-16 19:29:31,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 148 flow. Second operand has 38 states, 38 states have (on average 17.263157894736842) internal successors, (656), 38 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:29:31,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:29:31,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2024-11-16 19:29:31,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:29:37,781 INFO L124 PetriNetUnfolderBase]: 3214/5597 cut-off events. [2024-11-16 19:29:37,781 INFO L125 PetriNetUnfolderBase]: For 1230/1240 co-relation queries the response was YES. [2024-11-16 19:29:37,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11846 conditions, 5597 events. 3214/5597 cut-off events. For 1230/1240 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 34406 event pairs, 186 based on Foata normal form. 30/5413 useless extension candidates. Maximal degree in co-relation 11836. Up to 1322 conditions per place. [2024-11-16 19:29:37,821 INFO L140 encePairwiseOnDemand]: 40/57 looper letters, 326 selfloop transitions, 101 changer transitions 3/442 dead transitions. [2024-11-16 19:29:37,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 442 transitions, 2055 flow [2024-11-16 19:29:37,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-16 19:29:37,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2024-11-16 19:29:37,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 1216 transitions. [2024-11-16 19:29:37,828 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2024-11-16 19:29:37,829 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 148 flow. Second operand 52 states and 1216 transitions. [2024-11-16 19:29:37,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 442 transitions, 2055 flow [2024-11-16 19:29:37,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 442 transitions, 2026 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-11-16 19:29:37,840 INFO L231 Difference]: Finished difference. Result has 124 places, 152 transitions, 880 flow [2024-11-16 19:29:37,841 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=880, PETRI_PLACES=124, PETRI_TRANSITIONS=152} [2024-11-16 19:29:37,843 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 73 predicate places. [2024-11-16 19:29:37,843 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 152 transitions, 880 flow [2024-11-16 19:29:37,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 17.263157894736842) internal successors, (656), 38 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:29:37,844 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:29:37,844 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:29:37,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 19:29:38,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:29:38,049 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-16 19:29:38,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:29:38,050 INFO L85 PathProgramCache]: Analyzing trace with hash -547768538, now seen corresponding path program 2 times [2024-11-16 19:29:38,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:29:38,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563590507] [2024-11-16 19:29:38,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:29:38,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:29:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:29:39,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:29:39,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:29:39,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563590507] [2024-11-16 19:29:39,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563590507] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:29:39,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598504848] [2024-11-16 19:29:39,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 19:29:39,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:29:39,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:29:39,433 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-11-16 19:29:39,435 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-11-16 19:29:39,529 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-16 19:29:39,529 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 19:29:39,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-16 19:29:39,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:29:39,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 19:29:39,917 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 19:29:39,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598504848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:29:39,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 19:29:39,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 20 [2024-11-16 19:29:39,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140653596] [2024-11-16 19:29:39,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:29:39,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 19:29:39,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:29:39,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 19:29:39,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2024-11-16 19:29:39,961 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 57 [2024-11-16 19:29:39,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 152 transitions, 880 flow. Second operand has 9 states, 9 states have (on average 21.0) internal successors, (189), 9 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:29:39,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:29:39,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 57 [2024-11-16 19:29:39,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:29:40,586 INFO L124 PetriNetUnfolderBase]: 2850/5203 cut-off events. [2024-11-16 19:29:40,586 INFO L125 PetriNetUnfolderBase]: For 13583/13630 co-relation queries the response was YES. [2024-11-16 19:29:40,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15356 conditions, 5203 events. 2850/5203 cut-off events. For 13583/13630 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 33705 event pairs, 679 based on Foata normal form. 106/5217 useless extension candidates. Maximal degree in co-relation 15329. Up to 2803 conditions per place. [2024-11-16 19:29:40,639 INFO L140 encePairwiseOnDemand]: 48/57 looper letters, 126 selfloop transitions, 32 changer transitions 2/182 dead transitions. [2024-11-16 19:29:40,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 182 transitions, 1209 flow [2024-11-16 19:29:40,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 19:29:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-16 19:29:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 233 transitions. [2024-11-16 19:29:40,641 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5109649122807017 [2024-11-16 19:29:40,642 INFO L175 Difference]: Start difference. First operand has 124 places, 152 transitions, 880 flow. Second operand 8 states and 233 transitions. [2024-11-16 19:29:40,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 182 transitions, 1209 flow [2024-11-16 19:29:40,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 182 transitions, 1093 flow, removed 39 selfloop flow, removed 5 redundant places. [2024-11-16 19:29:40,685 INFO L231 Difference]: Finished difference. Result has 123 places, 134 transitions, 778 flow [2024-11-16 19:29:40,686 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=778, PETRI_PLACES=123, PETRI_TRANSITIONS=134} [2024-11-16 19:29:40,686 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 72 predicate places. [2024-11-16 19:29:40,686 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 134 transitions, 778 flow [2024-11-16 19:29:40,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.0) internal successors, (189), 9 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:29:40,687 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:29:40,687 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:29:40,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 19:29:40,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 19:29:40,888 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-16 19:29:40,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:29:40,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1167504359, now seen corresponding path program 1 times [2024-11-16 19:29:40,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:29:40,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037623016] [2024-11-16 19:29:40,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:29:40,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:29:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:29:41,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 19:29:41,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:29:41,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037623016] [2024-11-16 19:29:41,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037623016] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:29:41,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698882112] [2024-11-16 19:29:41,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:29:41,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:29:41,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:29:41,030 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-11-16 19:29:41,031 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-11-16 19:29:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:29:41,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 19:29:41,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:29:41,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 19:29:41,203 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:29:41,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 19:29:41,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698882112] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:29:41,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:29:41,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-16 19:29:41,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311887299] [2024-11-16 19:29:41,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:29:41,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 19:29:41,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:29:41,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 19:29:41,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-16 19:29:41,304 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 57 [2024-11-16 19:29:41,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 134 transitions, 778 flow. Second operand has 12 states, 12 states have (on average 23.416666666666668) internal successors, (281), 12 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:29:41,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:29:41,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 57 [2024-11-16 19:29:41,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:29:41,870 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([632] L88-->L93: Formula: (and (= (select (select |v_#memory_int#1_80| v_~q2~0.base_39) (+ v_~q2~0.offset_39 (* 4 v_~q2_front~0_71))) |v_thread3Thread1of1ForFork1_~k~0#1_3|) (not (= (ite (and (<= 0 v_~q2_front~0_71) (< v_~q2_front~0_71 v_~n2~0_52) (< v_~q2_front~0_71 v_~q2_back~0_66)) 1 0) 0)) (= (+ v_~q2_front~0_71 1) v_~q2_front~0_70)) InVars {~n2~0=v_~n2~0_52, ~q2~0.offset=v_~q2~0.offset_39, ~q2_front~0=v_~q2_front~0_71, ~q2~0.base=v_~q2~0.base_39, #memory_int#1=|v_#memory_int#1_80|, ~q2_back~0=v_~q2_back~0_66} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork1_#t~mem10#1=|v_thread3Thread1of1ForFork1_#t~mem10#1_1|, ~n2~0=v_~n2~0_52, ~q2~0.offset=v_~q2~0.offset_39, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, ~q2_front~0=v_~q2_front~0_70, ~q2~0.base=v_~q2~0.base_39, thread3Thread1of1ForFork1_~k~0#1=|v_thread3Thread1of1ForFork1_~k~0#1_3|, #memory_int#1=|v_#memory_int#1_80|, ~q2_back~0=v_~q2_back~0_66} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~mem10#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~post11#1, ~q2_front~0, thread3Thread1of1ForFork1_~k~0#1][146], [Black: 102#(and (<= ~q2_front~0 ~q2_back~0) (= ~t~0 0) (= ~q1_back~0 ~q1_front~0) (= ~s~0 0)), Black: 125#(and (<= ~q2_front~0 ~q2_back~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= ~t~0 0) (= ~q1_back~0 ~q1_front~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~s~0 0)), Black: 271#(or (< ~n2~0 (+ 1 ~q2_front~0)) (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) 2 (* (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2)) ~s~0)), Black: 396#(and (or (< ~n2~0 (+ 1 ~q2_front~0)) (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) 2 (* (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2)) (+ |thread2Thread1of1ForFork2_~j~0#1| ~s~0))) (or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0)))), Black: 400#(and (or (< ~n2~0 (+ 1 ~q2_front~0)) (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) 2 (* (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2)) ~s~0)) (or (< ~n2~0 (+ 1 ~q2_front~0)) (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) 2 (* (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2)) (+ |thread2Thread1of1ForFork2_~j~0#1| ~s~0)))), Black: 382#(and (or (not (= ~q2_back~0 0)) (and (<= ~n1~0 1) (= 0 ~q2_front~0))) (<= ~q2_front~0 ~q2_back~0) (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= ~t~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (not (= ~q2_back~0 0))) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 44#L93true, 612#true, Black: 67#(<= ~n1~0 0), Black: 66#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 416#(and (or (< ~n2~0 (+ 1 ~q2_front~0)) (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) 2 (* (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2)) ~s~0)) (or (< ~n2~0 (+ 1 ~q2_front~0)) (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) 2 (* (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2)) (+ |thread2Thread1of1ForFork2_~j~0#1| ~s~0))) (or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0)))), Black: 98#(= (+ (* 2 ~t~0) 2) ~s~0), Black: 202#(and (<= 0 |thread2Thread1of1ForFork2_~j~0#1|) (exists ((v_~q2_back~0_84 Int)) (and (<= 0 v_~q2_back~0_84) (= |thread2Thread1of1ForFork2_~j~0#1| (+ (select (select |#memory_int#1| ~q2~0.base) (+ ~q2~0.offset (* v_~q2_back~0_84 4))) 1)) (<= ~q2_front~0 v_~q2_back~0_84) (<= (+ v_~q2_back~0_84 1) ~n2~0))) (<= ~n2~0 1) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_front~0_86 Int)) (= (select (select |#memory_int#1| ~q1~0.base) (+ (* 4 v_~q1_front~0_86) ~q1~0.offset)) 0)) (= ~t~0 0) (= |thread2Thread1of1ForFork2_~j~0#1| ~s~0)), Black: 388#(and (or (and (or (= (+ (select (select |#memory_int#1| ~q2~0.base) 0) 1) 0) (< ~q1_back~0 1) (< ~n1~0 2)) (= 0 ~q2_front~0)) (not (= ~q2_back~0 0))) (<= ~n2~0 1) (<= ~q2_front~0 ~q2_back~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~q1_back~0 ~q1_front~0) (= ~q2~0.offset 0) (= ~s~0 0)), Black: 75#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 15#L124true, 58#true, Black: 570#(and (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_front~0_87 Int)) (= (select (select |#memory_int#1| ~q1~0.base) (+ (* 4 v_~q1_front~0_87) ~q1~0.offset)) 0)) (= ~t~0 0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= ~s~0 0) (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) 0)), Black: 474#(and (= (+ ~t~0 1) 0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= ~s~0 0)), Black: 550#(and (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0) (= ~t~0 0) (= ~q2_back~0 ~q2_front~0) (= ~s~0 0)), Black: 473#(and (= (+ |thread3Thread1of1ForFork1_~k~0#1| 1) 0) (= ~t~0 0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= ~s~0 0)), 461#true, Black: 408#(and (= (+ (* 2 ~t~0) (* 2 |thread3Thread1of1ForFork1_~k~0#1|) 2) ~s~0) (or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0)))), Black: 220#(and (= (+ ~t~0 1) 0) (= ~s~0 0)), 360#(or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0))), Black: 436#(and (= (+ (select (select |#memory_int#1| ~q2~0.base) 0) 1) 0) (= (+ |thread3Thread1of1ForFork1_~k~0#1| 1) 0) (= ~t~0 0) (= 0 ~q2_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= ~q1_back~0 ~q1_front~0) (= ~q2~0.offset 0) (<= 0 ~q2_back~0) (= ~s~0 0)), Black: 132#(and (<= ~n2~0 1) (<= ~q2_front~0 ~q2_back~0) (= ~t~0 0) (= ~q1_back~0 ~q1_front~0) (= ~s~0 0)), Black: 418#(and (or (< ~n2~0 (+ 1 ~q2_front~0)) (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) 2 (* (select (select |#memory_int#1| ~q2~0.base) (* 4 ~q2_front~0)) 2)) ~s~0)) (or (< ~n2~0 2) (< ~q2_back~0 1)) (or (< ~n2~0 (+ 1 ~q2_front~0)) (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (< ~q2_front~0 0) (= (+ |thread2Thread1of1ForFork2_~j~0#1| ~s~0) (+ (* 2 ~t~0) 2 (* (select (select |#memory_int#1| ~q2~0.base) (* 4 ~q2_front~0)) 2)))) (= ~q2~0.offset 0) (or (not (= ~q2_back~0 0)) (and (= 0 ~q2_front~0) (or (= (+ (select (select |#memory_int#1| ~q2~0.base) 0) 1) 0) (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (= ~t~0 0) (= ~s~0 0)))))), Black: 62#(= ~q2_back~0 ~q2_front~0), Black: 376#(and (or (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (< ~q2_front~0 0) (< ~n2~0 (+ ~q2_back~0 1)) (= |thread2Thread1of1ForFork2_~j~0#1| (+ 2 (* (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2))) (not (= |thread2Thread1of1ForFork2_~j~0#1| (+ (select (select |#memory_int#1| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1)))) (<= ~n2~0 1) (<= ~q2_front~0 ~q2_back~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= ~t~0 0) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q2_back~0 0)) (and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= 0 ~q2_front~0))) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))]) [2024-11-16 19:29:41,870 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-11-16 19:29:41,870 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-11-16 19:29:41,870 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-11-16 19:29:41,870 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-11-16 19:29:41,871 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([632] L88-->L93: Formula: (and (= (select (select |v_#memory_int#1_80| v_~q2~0.base_39) (+ v_~q2~0.offset_39 (* 4 v_~q2_front~0_71))) |v_thread3Thread1of1ForFork1_~k~0#1_3|) (not (= (ite (and (<= 0 v_~q2_front~0_71) (< v_~q2_front~0_71 v_~n2~0_52) (< v_~q2_front~0_71 v_~q2_back~0_66)) 1 0) 0)) (= (+ v_~q2_front~0_71 1) v_~q2_front~0_70)) InVars {~n2~0=v_~n2~0_52, ~q2~0.offset=v_~q2~0.offset_39, ~q2_front~0=v_~q2_front~0_71, ~q2~0.base=v_~q2~0.base_39, #memory_int#1=|v_#memory_int#1_80|, ~q2_back~0=v_~q2_back~0_66} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork1_#t~mem10#1=|v_thread3Thread1of1ForFork1_#t~mem10#1_1|, ~n2~0=v_~n2~0_52, ~q2~0.offset=v_~q2~0.offset_39, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, ~q2_front~0=v_~q2_front~0_70, ~q2~0.base=v_~q2~0.base_39, thread3Thread1of1ForFork1_~k~0#1=|v_thread3Thread1of1ForFork1_~k~0#1_3|, #memory_int#1=|v_#memory_int#1_80|, ~q2_back~0=v_~q2_back~0_66} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~mem10#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~post11#1, ~q2_front~0, thread3Thread1of1ForFork1_~k~0#1][146], [Black: 102#(and (<= ~q2_front~0 ~q2_back~0) (= ~t~0 0) (= ~q1_back~0 ~q1_front~0) (= ~s~0 0)), Black: 125#(and (<= ~q2_front~0 ~q2_back~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= ~t~0 0) (= ~q1_back~0 ~q1_front~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~s~0 0)), Black: 271#(or (< ~n2~0 (+ 1 ~q2_front~0)) (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) 2 (* (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2)) ~s~0)), Black: 396#(and (or (< ~n2~0 (+ 1 ~q2_front~0)) (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) 2 (* (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2)) (+ |thread2Thread1of1ForFork2_~j~0#1| ~s~0))) (or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0)))), Black: 400#(and (or (< ~n2~0 (+ 1 ~q2_front~0)) (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) 2 (* (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2)) ~s~0)) (or (< ~n2~0 (+ 1 ~q2_front~0)) (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) 2 (* (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2)) (+ |thread2Thread1of1ForFork2_~j~0#1| ~s~0)))), Black: 382#(and (or (not (= ~q2_back~0 0)) (and (<= ~n1~0 1) (= 0 ~q2_front~0))) (<= ~q2_front~0 ~q2_back~0) (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= ~t~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (not (= ~q2_back~0 0))) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 44#L93true, 612#true, Black: 67#(<= ~n1~0 0), Black: 66#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 416#(and (or (< ~n2~0 (+ 1 ~q2_front~0)) (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) 2 (* (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2)) ~s~0)) (or (< ~n2~0 (+ 1 ~q2_front~0)) (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) 2 (* (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2)) (+ |thread2Thread1of1ForFork2_~j~0#1| ~s~0))) (or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0)))), Black: 98#(= (+ (* 2 ~t~0) 2) ~s~0), Black: 202#(and (<= 0 |thread2Thread1of1ForFork2_~j~0#1|) (exists ((v_~q2_back~0_84 Int)) (and (<= 0 v_~q2_back~0_84) (= |thread2Thread1of1ForFork2_~j~0#1| (+ (select (select |#memory_int#1| ~q2~0.base) (+ ~q2~0.offset (* v_~q2_back~0_84 4))) 1)) (<= ~q2_front~0 v_~q2_back~0_84) (<= (+ v_~q2_back~0_84 1) ~n2~0))) (<= ~n2~0 1) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_front~0_86 Int)) (= (select (select |#memory_int#1| ~q1~0.base) (+ (* 4 v_~q1_front~0_86) ~q1~0.offset)) 0)) (= ~t~0 0) (= |thread2Thread1of1ForFork2_~j~0#1| ~s~0)), Black: 388#(and (or (and (or (= (+ (select (select |#memory_int#1| ~q2~0.base) 0) 1) 0) (< ~q1_back~0 1) (< ~n1~0 2)) (= 0 ~q2_front~0)) (not (= ~q2_back~0 0))) (<= ~n2~0 1) (<= ~q2_front~0 ~q2_back~0) (= ~q1~0.offset 0) (= ~t~0 0) (= ~q1_back~0 ~q1_front~0) (= ~q2~0.offset 0) (= ~s~0 0)), Black: 75#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 21#L123true, 58#true, Black: 570#(and (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_front~0_87 Int)) (= (select (select |#memory_int#1| ~q1~0.base) (+ (* 4 v_~q1_front~0_87) ~q1~0.offset)) 0)) (= ~t~0 0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= ~s~0 0) (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) 0)), Black: 474#(and (= (+ ~t~0 1) 0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= ~s~0 0)), Black: 550#(and (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0) (= ~t~0 0) (= ~q2_back~0 ~q2_front~0) (= ~s~0 0)), Black: 473#(and (= (+ |thread3Thread1of1ForFork1_~k~0#1| 1) 0) (= ~t~0 0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= ~s~0 0)), 461#true, Black: 408#(and (= (+ (* 2 ~t~0) (* 2 |thread3Thread1of1ForFork1_~k~0#1|) 2) ~s~0) (or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0)))), Black: 220#(and (= (+ ~t~0 1) 0) (= ~s~0 0)), 360#(or (not (= 0 ~q2_front~0)) (and (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0))), 11#thread2EXITtrue, Black: 436#(and (= (+ (select (select |#memory_int#1| ~q2~0.base) 0) 1) 0) (= (+ |thread3Thread1of1ForFork1_~k~0#1| 1) 0) (= ~t~0 0) (= 0 ~q2_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= ~q1_back~0 ~q1_front~0) (= ~q2~0.offset 0) (<= 0 ~q2_back~0) (= ~s~0 0)), Black: 132#(and (<= ~n2~0 1) (<= ~q2_front~0 ~q2_back~0) (= ~t~0 0) (= ~q1_back~0 ~q1_front~0) (= ~s~0 0)), Black: 418#(and (or (< ~n2~0 (+ 1 ~q2_front~0)) (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (< ~q2_front~0 0) (= (+ (* 2 ~t~0) 2 (* (select (select |#memory_int#1| ~q2~0.base) (* 4 ~q2_front~0)) 2)) ~s~0)) (or (< ~n2~0 2) (< ~q2_back~0 1)) (or (< ~n2~0 (+ 1 ~q2_front~0)) (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (< ~q2_front~0 0) (= (+ |thread2Thread1of1ForFork2_~j~0#1| ~s~0) (+ (* 2 ~t~0) 2 (* (select (select |#memory_int#1| ~q2~0.base) (* 4 ~q2_front~0)) 2)))) (= ~q2~0.offset 0) (or (not (= ~q2_back~0 0)) (and (= 0 ~q2_front~0) (or (= (+ (select (select |#memory_int#1| ~q2~0.base) 0) 1) 0) (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (or (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (and (= ~t~0 0) (= ~s~0 0)))))), Black: 62#(= ~q2_back~0 ~q2_front~0), Black: 376#(and (or (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (< ~q2_front~0 0) (< ~n2~0 (+ ~q2_back~0 1)) (= |thread2Thread1of1ForFork2_~j~0#1| (+ 2 (* (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2))) (not (= |thread2Thread1of1ForFork2_~j~0#1| (+ (select (select |#memory_int#1| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1)))) (<= ~n2~0 1) (<= ~q2_front~0 ~q2_back~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= ~t~0 0) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q2_back~0 0)) (and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= 0 ~q2_front~0))) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))]) [2024-11-16 19:29:41,871 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-11-16 19:29:41,871 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-11-16 19:29:41,871 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-11-16 19:29:41,872 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-11-16 19:29:41,887 INFO L124 PetriNetUnfolderBase]: 2866/6274 cut-off events. [2024-11-16 19:29:41,887 INFO L125 PetriNetUnfolderBase]: For 20738/20892 co-relation queries the response was YES. [2024-11-16 19:29:41,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17659 conditions, 6274 events. 2866/6274 cut-off events. For 20738/20892 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 50408 event pairs, 1532 based on Foata normal form. 260/6112 useless extension candidates. Maximal degree in co-relation 17629. Up to 2476 conditions per place. [2024-11-16 19:29:41,921 INFO L140 encePairwiseOnDemand]: 50/57 looper letters, 113 selfloop transitions, 9 changer transitions 9/182 dead transitions. [2024-11-16 19:29:41,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 182 transitions, 1268 flow [2024-11-16 19:29:41,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 19:29:41,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-16 19:29:41,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 227 transitions. [2024-11-16 19:29:41,923 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49780701754385964 [2024-11-16 19:29:41,923 INFO L175 Difference]: Start difference. First operand has 123 places, 134 transitions, 778 flow. Second operand 8 states and 227 transitions. [2024-11-16 19:29:41,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 182 transitions, 1268 flow [2024-11-16 19:29:41,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 182 transitions, 1235 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-11-16 19:29:41,989 INFO L231 Difference]: Finished difference. Result has 129 places, 134 transitions, 805 flow [2024-11-16 19:29:41,989 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=805, PETRI_PLACES=129, PETRI_TRANSITIONS=134} [2024-11-16 19:29:41,990 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 78 predicate places. [2024-11-16 19:29:41,990 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 134 transitions, 805 flow [2024-11-16 19:29:41,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 23.416666666666668) internal successors, (281), 12 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:29:41,991 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:29:41,991 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:29:42,005 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-11-16 19:29:42,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:29:42,192 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-16 19:29:42,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:29:42,192 INFO L85 PathProgramCache]: Analyzing trace with hash -654088319, now seen corresponding path program 1 times [2024-11-16 19:29:42,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:29:42,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575637779] [2024-11-16 19:29:42,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:29:42,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:29:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:29:42,341 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 19:29:42,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:29:42,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575637779] [2024-11-16 19:29:42,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575637779] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:29:42,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031801040] [2024-11-16 19:29:42,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:29:42,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:29:42,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:29:42,344 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-11-16 19:29:42,346 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-11-16 19:29:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:29:42,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 19:29:42,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:29:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 19:29:42,533 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:29:42,644 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 19:29:42,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031801040] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:29:42,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:29:42,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2024-11-16 19:29:42,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558615485] [2024-11-16 19:29:42,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:29:42,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 19:29:42,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:29:42,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 19:29:42,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-16 19:29:42,649 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 57 [2024-11-16 19:29:42,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 134 transitions, 805 flow. Second operand has 13 states, 13 states have (on average 23.153846153846153) internal successors, (301), 13 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:29:42,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:29:42,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 57 [2024-11-16 19:29:42,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:29:43,768 INFO L124 PetriNetUnfolderBase]: 3381/7548 cut-off events. [2024-11-16 19:29:43,769 INFO L125 PetriNetUnfolderBase]: For 27911/28161 co-relation queries the response was YES. [2024-11-16 19:29:43,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22584 conditions, 7548 events. 3381/7548 cut-off events. For 27911/28161 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 64209 event pairs, 784 based on Foata normal form. 235/7334 useless extension candidates. Maximal degree in co-relation 22552. Up to 2078 conditions per place. [2024-11-16 19:29:43,902 INFO L140 encePairwiseOnDemand]: 49/57 looper letters, 112 selfloop transitions, 19 changer transitions 36/200 dead transitions. [2024-11-16 19:29:43,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 200 transitions, 1500 flow [2024-11-16 19:29:43,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 19:29:43,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-16 19:29:43,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 312 transitions. [2024-11-16 19:29:43,905 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49760765550239233 [2024-11-16 19:29:43,905 INFO L175 Difference]: Start difference. First operand has 129 places, 134 transitions, 805 flow. Second operand 11 states and 312 transitions. [2024-11-16 19:29:43,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 200 transitions, 1500 flow [2024-11-16 19:29:44,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 200 transitions, 1430 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-11-16 19:29:44,014 INFO L231 Difference]: Finished difference. Result has 134 places, 108 transitions, 663 flow [2024-11-16 19:29:44,014 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=663, PETRI_PLACES=134, PETRI_TRANSITIONS=108} [2024-11-16 19:29:44,015 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 83 predicate places. [2024-11-16 19:29:44,015 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 108 transitions, 663 flow [2024-11-16 19:29:44,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 23.153846153846153) internal successors, (301), 13 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:29:44,016 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:29:44,016 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:29:44,034 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-11-16 19:29:44,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:29:44,217 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-16 19:29:44,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:29:44,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1913356046, now seen corresponding path program 2 times [2024-11-16 19:29:44,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:29:44,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677898985] [2024-11-16 19:29:44,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:29:44,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:29:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:29:44,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 19:29:44,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:29:44,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677898985] [2024-11-16 19:29:44,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677898985] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:29:44,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002242760] [2024-11-16 19:29:44,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 19:29:44,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:29:44,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:29:44,763 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-11-16 19:29:44,765 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-11-16 19:29:44,857 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 19:29:44,858 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 19:29:44,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 19:29:44,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:29:44,970 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 19:29:44,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:29:45,047 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-16 19:29:45,047 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 24 treesize of output 11 [2024-11-16 19:29:45,071 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-16 19:29:45,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002242760] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:29:45,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:29:45,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 4] total 15 [2024-11-16 19:29:45,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849616818] [2024-11-16 19:29:45,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:29:45,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 19:29:45,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:29:45,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 19:29:45,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-16 19:29:45,109 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 57 [2024-11-16 19:29:45,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 108 transitions, 663 flow. Second operand has 16 states, 16 states have (on average 22.625) internal successors, (362), 16 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:29:45,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:29:45,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 57 [2024-11-16 19:29:45,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:29:46,478 INFO L124 PetriNetUnfolderBase]: 5011/10241 cut-off events. [2024-11-16 19:29:46,478 INFO L125 PetriNetUnfolderBase]: For 44638/44759 co-relation queries the response was YES. [2024-11-16 19:29:46,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33526 conditions, 10241 events. 5011/10241 cut-off events. For 44638/44759 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 84956 event pairs, 696 based on Foata normal form. 222/9944 useless extension candidates. Maximal degree in co-relation 33493. Up to 3171 conditions per place. [2024-11-16 19:29:46,550 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 153 selfloop transitions, 38 changer transitions 6/222 dead transitions. [2024-11-16 19:29:46,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 222 transitions, 1718 flow [2024-11-16 19:29:46,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 19:29:46,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-11-16 19:29:46,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 437 transitions. [2024-11-16 19:29:46,552 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2024-11-16 19:29:46,553 INFO L175 Difference]: Start difference. First operand has 134 places, 108 transitions, 663 flow. Second operand 17 states and 437 transitions. [2024-11-16 19:29:46,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 222 transitions, 1718 flow [2024-11-16 19:29:46,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 222 transitions, 1613 flow, removed 30 selfloop flow, removed 11 redundant places. [2024-11-16 19:29:46,754 INFO L231 Difference]: Finished difference. Result has 121 places, 117 transitions, 803 flow [2024-11-16 19:29:46,755 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=803, PETRI_PLACES=121, PETRI_TRANSITIONS=117} [2024-11-16 19:29:46,756 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 70 predicate places. [2024-11-16 19:29:46,756 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 117 transitions, 803 flow [2024-11-16 19:29:46,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 22.625) internal successors, (362), 16 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:29:46,757 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:29:46,757 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:29:46,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-16 19:29:46,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:29:46,958 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-16 19:29:46,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:29:46,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1843276407, now seen corresponding path program 2 times [2024-11-16 19:29:46,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:29:46,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889721379] [2024-11-16 19:29:46,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:29:46,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:29:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:29:47,064 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-16 19:29:47,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:29:47,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889721379] [2024-11-16 19:29:47,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889721379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:29:47,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:29:47,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:29:47,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840763892] [2024-11-16 19:29:47,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:29:47,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:29:47,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:29:47,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:29:47,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:29:47,068 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 57 [2024-11-16 19:29:47,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 117 transitions, 803 flow. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:29:47,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:29:47,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 57 [2024-11-16 19:29:47,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:29:47,957 INFO L124 PetriNetUnfolderBase]: 4001/9077 cut-off events. [2024-11-16 19:29:47,957 INFO L125 PetriNetUnfolderBase]: For 33497/33859 co-relation queries the response was YES. [2024-11-16 19:29:47,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28025 conditions, 9077 events. 4001/9077 cut-off events. For 33497/33859 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 78249 event pairs, 1257 based on Foata normal form. 264/8816 useless extension candidates. Maximal degree in co-relation 27994. Up to 2669 conditions per place. [2024-11-16 19:29:48,024 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 106 selfloop transitions, 12 changer transitions 15/164 dead transitions. [2024-11-16 19:29:48,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 164 transitions, 1337 flow [2024-11-16 19:29:48,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 19:29:48,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-16 19:29:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2024-11-16 19:29:48,026 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6535087719298246 [2024-11-16 19:29:48,026 INFO L175 Difference]: Start difference. First operand has 121 places, 117 transitions, 803 flow. Second operand 4 states and 149 transitions. [2024-11-16 19:29:48,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 164 transitions, 1337 flow [2024-11-16 19:29:48,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 164 transitions, 1288 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-11-16 19:29:48,160 INFO L231 Difference]: Finished difference. Result has 121 places, 107 transitions, 743 flow [2024-11-16 19:29:48,161 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=743, PETRI_PLACES=121, PETRI_TRANSITIONS=107} [2024-11-16 19:29:48,161 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 70 predicate places. [2024-11-16 19:29:48,161 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 107 transitions, 743 flow [2024-11-16 19:29:48,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:29:48,162 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:29:48,162 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:29:48,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 19:29:48,163 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-16 19:29:48,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:29:48,163 INFO L85 PathProgramCache]: Analyzing trace with hash 334000072, now seen corresponding path program 1 times [2024-11-16 19:29:48,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:29:48,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543734269] [2024-11-16 19:29:48,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:29:48,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:29:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:29:48,360 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-16 19:29:48,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:29:48,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543734269] [2024-11-16 19:29:48,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543734269] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:29:48,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182241785] [2024-11-16 19:29:48,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:29:48,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:29:48,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:29:48,365 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 19:29:48,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-16 19:29:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:29:48,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 19:29:48,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:29:48,557 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-16 19:29:48,557 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:29:48,652 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-16 19:29:48,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182241785] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:29:48,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:29:48,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-16 19:29:48,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145470234] [2024-11-16 19:29:48,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:29:48,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 19:29:48,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:29:48,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 19:29:48,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-16 19:29:48,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 57 [2024-11-16 19:29:48,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 107 transitions, 743 flow. Second operand has 12 states, 12 states have (on average 23.583333333333332) internal successors, (283), 12 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:29:48,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:29:48,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 57 [2024-11-16 19:29:48,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:29:49,320 INFO L124 PetriNetUnfolderBase]: 3081/6801 cut-off events. [2024-11-16 19:29:49,321 INFO L125 PetriNetUnfolderBase]: For 26842/27209 co-relation queries the response was YES. [2024-11-16 19:29:49,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21934 conditions, 6801 events. 3081/6801 cut-off events. For 26842/27209 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 53975 event pairs, 1654 based on Foata normal form. 88/6491 useless extension candidates. Maximal degree in co-relation 21901. Up to 3140 conditions per place. [2024-11-16 19:29:49,369 INFO L140 encePairwiseOnDemand]: 50/57 looper letters, 64 selfloop transitions, 8 changer transitions 35/134 dead transitions. [2024-11-16 19:29:49,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 134 transitions, 1078 flow [2024-11-16 19:29:49,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 19:29:49,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-16 19:29:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 262 transitions. [2024-11-16 19:29:49,371 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45964912280701753 [2024-11-16 19:29:49,371 INFO L175 Difference]: Start difference. First operand has 121 places, 107 transitions, 743 flow. Second operand 10 states and 262 transitions. [2024-11-16 19:29:49,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 134 transitions, 1078 flow [2024-11-16 19:29:49,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 134 transitions, 997 flow, removed 33 selfloop flow, removed 10 redundant places. [2024-11-16 19:29:49,476 INFO L231 Difference]: Finished difference. Result has 109 places, 99 transitions, 609 flow [2024-11-16 19:29:49,476 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=609, PETRI_PLACES=109, PETRI_TRANSITIONS=99} [2024-11-16 19:29:49,477 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 58 predicate places. [2024-11-16 19:29:49,477 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 99 transitions, 609 flow [2024-11-16 19:29:49,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 23.583333333333332) internal successors, (283), 12 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:29:49,477 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:29:49,477 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:29:49,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-16 19:29:49,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:29:49,680 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-16 19:29:49,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:29:49,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1302528066, now seen corresponding path program 2 times [2024-11-16 19:29:49,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:29:49,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878061829] [2024-11-16 19:29:49,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:29:49,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:29:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:29:51,049 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:29:51,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:29:51,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878061829] [2024-11-16 19:29:51,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878061829] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:29:51,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540754741] [2024-11-16 19:29:51,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 19:29:51,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:29:51,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:29:51,051 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 19:29:51,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-16 19:29:51,138 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 19:29:51,138 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 19:29:51,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-16 19:29:51,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:29:51,724 INFO L349 Elim1Store]: treesize reduction 25, result has 49.0 percent of original size [2024-11-16 19:29:51,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 33 [2024-11-16 19:29:51,738 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 19:29:51,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:29:52,335 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2024-11-16 19:29:52,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 101 [2024-11-16 19:29:52,905 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 19:29:52,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540754741] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:29:52,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:29:52,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 35 [2024-11-16 19:29:52,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566029889] [2024-11-16 19:29:52,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:29:52,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-16 19:29:52,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:29:52,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-16 19:29:52,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1137, Unknown=0, NotChecked=0, Total=1260 [2024-11-16 19:29:53,140 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-11-16 19:29:53,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 99 transitions, 609 flow. Second operand has 36 states, 36 states have (on average 18.666666666666668) internal successors, (672), 36 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:29:53,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:29:53,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-11-16 19:29:53,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:29:59,760 INFO L124 PetriNetUnfolderBase]: 19444/35981 cut-off events. [2024-11-16 19:29:59,760 INFO L125 PetriNetUnfolderBase]: For 131527/131595 co-relation queries the response was YES. [2024-11-16 19:29:59,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114442 conditions, 35981 events. 19444/35981 cut-off events. For 131527/131595 co-relation queries the response was YES. Maximal size of possible extension queue 1320. Compared 325348 event pairs, 533 based on Foata normal form. 48/33830 useless extension candidates. Maximal degree in co-relation 114415. Up to 6272 conditions per place. [2024-11-16 19:30:00,068 INFO L140 encePairwiseOnDemand]: 42/57 looper letters, 523 selfloop transitions, 218 changer transitions 0/760 dead transitions. [2024-11-16 19:30:00,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 760 transitions, 6024 flow [2024-11-16 19:30:00,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-16 19:30:00,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2024-11-16 19:30:00,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 1388 transitions. [2024-11-16 19:30:00,073 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4682860998650472 [2024-11-16 19:30:00,073 INFO L175 Difference]: Start difference. First operand has 109 places, 99 transitions, 609 flow. Second operand 52 states and 1388 transitions. [2024-11-16 19:30:00,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 760 transitions, 6024 flow [2024-11-16 19:30:00,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 760 transitions, 5762 flow, removed 116 selfloop flow, removed 11 redundant places. [2024-11-16 19:30:00,474 INFO L231 Difference]: Finished difference. Result has 167 places, 318 transitions, 3216 flow [2024-11-16 19:30:00,475 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=3216, PETRI_PLACES=167, PETRI_TRANSITIONS=318} [2024-11-16 19:30:00,476 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 116 predicate places. [2024-11-16 19:30:00,477 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 318 transitions, 3216 flow [2024-11-16 19:30:00,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 18.666666666666668) internal successors, (672), 36 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:30:00,477 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:30:00,477 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:30:00,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-16 19:30:00,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:30:00,682 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-16 19:30:00,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:30:00,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1641845776, now seen corresponding path program 3 times [2024-11-16 19:30:00,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:30:00,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620057278] [2024-11-16 19:30:00,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:30:00,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:30:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:30:01,976 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:30:01,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:30:01,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620057278] [2024-11-16 19:30:01,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620057278] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:30:01,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991776315] [2024-11-16 19:30:01,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-16 19:30:01,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:30:01,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:30:01,979 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 19:30:01,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-16 19:30:02,121 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-16 19:30:02,121 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 19:30:02,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-16 19:30:02,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:30:02,491 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 19:30:02,491 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:30:02,798 INFO L349 Elim1Store]: treesize reduction 12, result has 87.1 percent of original size [2024-11-16 19:30:02,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 97 [2024-11-16 19:30:02,967 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 19:30:02,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991776315] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:30:02,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:30:02,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8, 7] total 30 [2024-11-16 19:30:02,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324304478] [2024-11-16 19:30:02,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:30:02,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-16 19:30:02,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:30:02,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-16 19:30:02,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=849, Unknown=0, NotChecked=0, Total=930 [2024-11-16 19:30:03,156 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2024-11-16 19:30:03,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 318 transitions, 3216 flow. Second operand has 31 states, 31 states have (on average 18.096774193548388) internal successors, (561), 31 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:30:03,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:30:03,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2024-11-16 19:30:03,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:30:12,047 INFO L124 PetriNetUnfolderBase]: 28776/50250 cut-off events. [2024-11-16 19:30:12,047 INFO L125 PetriNetUnfolderBase]: For 648048/648489 co-relation queries the response was YES. [2024-11-16 19:30:12,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221463 conditions, 50250 events. 28776/50250 cut-off events. For 648048/648489 co-relation queries the response was YES. Maximal size of possible extension queue 1750. Compared 438878 event pairs, 2461 based on Foata normal form. 1337/50339 useless extension candidates. Maximal degree in co-relation 221415. Up to 10529 conditions per place. [2024-11-16 19:30:12,708 INFO L140 encePairwiseOnDemand]: 42/57 looper letters, 668 selfloop transitions, 213 changer transitions 0/896 dead transitions. [2024-11-16 19:30:12,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 896 transitions, 10784 flow [2024-11-16 19:30:12,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-16 19:30:12,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2024-11-16 19:30:12,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 759 transitions. [2024-11-16 19:30:12,710 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4295415959252971 [2024-11-16 19:30:12,710 INFO L175 Difference]: Start difference. First operand has 167 places, 318 transitions, 3216 flow. Second operand 31 states and 759 transitions. [2024-11-16 19:30:12,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 896 transitions, 10784 flow [2024-11-16 19:30:15,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 896 transitions, 9945 flow, removed 403 selfloop flow, removed 11 redundant places. [2024-11-16 19:30:15,414 INFO L231 Difference]: Finished difference. Result has 193 places, 428 transitions, 4790 flow [2024-11-16 19:30:15,415 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=2949, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=4790, PETRI_PLACES=193, PETRI_TRANSITIONS=428} [2024-11-16 19:30:15,415 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 142 predicate places. [2024-11-16 19:30:15,415 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 428 transitions, 4790 flow [2024-11-16 19:30:15,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 18.096774193548388) internal successors, (561), 31 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:30:15,416 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:30:15,416 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:30:15,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-16 19:30:15,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-16 19:30:15,617 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-16 19:30:15,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:30:15,617 INFO L85 PathProgramCache]: Analyzing trace with hash -793322951, now seen corresponding path program 1 times [2024-11-16 19:30:15,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:30:15,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728384522] [2024-11-16 19:30:15,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:30:15,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:30:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:30:18,444 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:30:18,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:30:18,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728384522] [2024-11-16 19:30:18,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728384522] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:30:18,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139290188] [2024-11-16 19:30:18,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:30:18,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:30:18,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:30:18,446 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 19:30:18,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-16 19:30:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:30:18,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-16 19:30:18,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:30:18,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-16 19:30:20,010 INFO L349 Elim1Store]: treesize reduction 27, result has 62.0 percent of original size [2024-11-16 19:30:20,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 66 [2024-11-16 19:30:20,157 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 19:30:20,157 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:30:22,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 19:30:22,691 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 451 treesize of output 425 [2024-11-16 19:30:22,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 19:30:22,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 83 [2024-11-16 19:30:25,941 INFO L349 Elim1Store]: treesize reduction 16, result has 98.9 percent of original size [2024-11-16 19:30:25,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 1663 treesize of output 2448